./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/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 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:01:45,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:01:45,238 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:01:45,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:01:45,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:01:45,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:01:45,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:01:45,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:01:45,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:01:45,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:01:45,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:01:45,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:01:45,277 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:01:45,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:01:45,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:01:45,279 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:01:45,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:01:45,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:01:45,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:01:45,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:01:45,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:01:45,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:01:45,284 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:01:45,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:01:45,285 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:01:45,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:01:45,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:01:45,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:01:45,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:45,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:01:45,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:01:45,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:01:45,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:01:45,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:01:45,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:01:45,291 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:01:45,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:01:45,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:01:45,292 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:01:45,293 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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/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 -> 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 [2023-11-19 08:01:45,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:01:45,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:01:45,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:01:45,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:01:45,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:01:45,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-11-19 08:01:48,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:01:49,262 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:01:49,263 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-11-19 08:01:49,274 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/data/3c6a665de/e5988c34d35745ffaa1d06af6651563b/FLAGeca9b9001 [2023-11-19 08:01:49,292 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/data/3c6a665de/e5988c34d35745ffaa1d06af6651563b [2023-11-19 08:01:49,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:01:49,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:01:49,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:49,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:01:49,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:01:49,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254e335a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49, skipping insertion in model container [2023-11-19 08:01:49,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,352 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:01:49,578 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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2023-11-19 08:01:49,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:49,656 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:01:49,670 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_7236a336-7294-4ff4-9bf7-40850b4ee8ae/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2023-11-19 08:01:49,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:49,712 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:01:49,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49 WrapperNode [2023-11-19 08:01:49,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:49,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:49,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:01:49,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:01:49,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,817 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-11-19 08:01:49,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:49,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:01:49,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:01:49,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:01:49,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:01:49,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:01:49,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:01:49,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:01:49,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (1/1) ... [2023-11-19 08:01:49,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:49,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:01:49,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:01:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:01:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 08:01:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 08:01:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:01:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:01:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:01:50,117 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:01:50,120 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:01:50,533 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:01:50,541 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:01:50,541 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 08:01:50,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:50 BoogieIcfgContainer [2023-11-19 08:01:50,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:01:50,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:01:50,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:01:50,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:01:50,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:49" (1/3) ... [2023-11-19 08:01:50,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6679d2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:50, skipping insertion in model container [2023-11-19 08:01:50,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:49" (2/3) ... [2023-11-19 08:01:50,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6679d2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:50, skipping insertion in model container [2023-11-19 08:01:50,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:50" (3/3) ... [2023-11-19 08:01:50,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2023-11-19 08:01:50,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:01:50,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:01:50,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:01:50,634 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;@29b40c1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:01:50,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:01:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-19 08:01:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:50,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:50,654 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:50,655 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:50,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:50,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1101967666, now seen corresponding path program 1 times [2023-11-19 08:01:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745351744] [2023-11-19 08:01:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:50,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:01:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:01:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:01:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:01:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:01:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:01:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:01:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:01:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:01:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:01:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:01:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745351744] [2023-11-19 08:01:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745351744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:01:51,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097791588] [2023-11-19 08:01:51,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:51,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:01:51,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:01:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:01:51,235 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 08:01:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:51,276 INFO L93 Difference]: Finished difference Result 97 states and 155 transitions. [2023-11-19 08:01:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:01:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2023-11-19 08:01:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:51,290 INFO L225 Difference]: With dead ends: 97 [2023-11-19 08:01:51,290 INFO L226 Difference]: Without dead ends: 46 [2023-11-19 08:01:51,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 08:01:51,298 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:51,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:01:51,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-19 08:01:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-19 08:01:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-19 08:01:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2023-11-19 08:01:51,342 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 93 [2023-11-19 08:01:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:51,343 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2023-11-19 08:01:51,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 08:01:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2023-11-19 08:01:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:51,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:51,350 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:01:51,351 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:51,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1987356686, now seen corresponding path program 1 times [2023-11-19 08:01:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032415] [2023-11-19 08:01:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:51,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:01:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:01:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:01:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:01:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:01:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:01:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:01:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:01:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:01:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:01:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:01:52,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032415] [2023-11-19 08:01:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:52,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:01:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171634636] [2023-11-19 08:01:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:01:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:01:52,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:01:52,968 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:53,393 INFO L93 Difference]: Finished difference Result 196 states and 275 transitions. [2023-11-19 08:01:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:01:53,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-11-19 08:01:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:53,402 INFO L225 Difference]: With dead ends: 196 [2023-11-19 08:01:53,402 INFO L226 Difference]: Without dead ends: 153 [2023-11-19 08:01:53,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:01:53,405 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 104 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:53,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 161 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:01:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-19 08:01:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 75. [2023-11-19 08:01:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-19 08:01:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2023-11-19 08:01:53,461 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 93 [2023-11-19 08:01:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:53,463 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2023-11-19 08:01:53,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2023-11-19 08:01:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:53,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:53,474 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:53,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:01:53,475 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:53,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1989203728, now seen corresponding path program 1 times [2023-11-19 08:01:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273183727] [2023-11-19 08:01:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:01:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:01:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:01:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:01:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:01:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:01:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:01:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:01:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:01:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:01:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:01:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273183727] [2023-11-19 08:01:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273183727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:56,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 08:01:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864731673] [2023-11-19 08:01:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 08:01:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 08:01:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-19 08:01:56,028 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:57,771 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2023-11-19 08:01:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 08:01:57,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-11-19 08:01:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:57,776 INFO L225 Difference]: With dead ends: 211 [2023-11-19 08:01:57,776 INFO L226 Difference]: Without dead ends: 209 [2023-11-19 08:01:57,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2023-11-19 08:01:57,778 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:57,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 365 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-19 08:01:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-19 08:01:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 148. [2023-11-19 08:01:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.168421052631579) internal successors, (111), 97 states have internal predecessors, (111), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 08:01:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 207 transitions. [2023-11-19 08:01:57,869 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 207 transitions. Word has length 93 [2023-11-19 08:01:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:57,871 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 207 transitions. [2023-11-19 08:01:57,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 207 transitions. [2023-11-19 08:01:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:57,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:57,877 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:57,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:01:57,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:57,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash -530756206, now seen corresponding path program 1 times [2023-11-19 08:01:57,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698246196] [2023-11-19 08:01:57,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:01:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:01:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:01:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:01:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:01:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:01:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:01:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:01:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:01:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:01:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:01:58,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:58,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698246196] [2023-11-19 08:01:58,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698246196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:01:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038615443] [2023-11-19 08:01:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:58,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:01:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:58,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:01:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:58,051 INFO L87 Difference]: Start difference. First operand 148 states and 207 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:58,100 INFO L93 Difference]: Finished difference Result 288 states and 405 transitions. [2023-11-19 08:01:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:01:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-11-19 08:01:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:58,106 INFO L225 Difference]: With dead ends: 288 [2023-11-19 08:01:58,106 INFO L226 Difference]: Without dead ends: 143 [2023-11-19 08:01:58,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:58,118 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:58,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:01:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-19 08:01:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-19 08:01:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-19 08:01:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 197 transitions. [2023-11-19 08:01:58,171 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 197 transitions. Word has length 93 [2023-11-19 08:01:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:58,172 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 197 transitions. [2023-11-19 08:01:58,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 197 transitions. [2023-11-19 08:01:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:01:58,174 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:58,174 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:58,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:01:58,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:58,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1627552240, now seen corresponding path program 1 times [2023-11-19 08:01:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091709871] [2023-11-19 08:01:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:01:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:01:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:01:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:01:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:01:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:01:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:01:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:01:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:01:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:01:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:01:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:01:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:01:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:01:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:01:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091709871] [2023-11-19 08:01:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091709871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:01:58,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:01:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:01:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305605849] [2023-11-19 08:01:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:01:58,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:01:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:01:58,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:01:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:58,298 INFO L87 Difference]: Start difference. First operand 143 states and 197 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:01:58,328 INFO L93 Difference]: Finished difference Result 249 states and 343 transitions. [2023-11-19 08:01:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:01:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2023-11-19 08:01:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:01:58,331 INFO L225 Difference]: With dead ends: 249 [2023-11-19 08:01:58,331 INFO L226 Difference]: Without dead ends: 109 [2023-11-19 08:01:58,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:01:58,334 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:01:58,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:01:58,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-19 08:01:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-19 08:01:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 67 states have internal predecessors, (71), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 08:01:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2023-11-19 08:01:58,365 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 93 [2023-11-19 08:01:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:01:58,366 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2023-11-19 08:01:58,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:01:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2023-11-19 08:01:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-19 08:01:58,368 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:01:58,368 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:01:58,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:01:58,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:01:58,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:01:58,369 INFO L85 PathProgramCache]: Analyzing trace with hash -980705042, now seen corresponding path program 1 times [2023-11-19 08:01:58,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:01:58,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157188153] [2023-11-19 08:01:58,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:01:58,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:01:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:02:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:02:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:02:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:02:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:02:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:02:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:02:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:02:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:02:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:02:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:02:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:02:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:02:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:02:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:02:05,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:05,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157188153] [2023-11-19 08:02:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157188153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:05,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 08:02:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230319001] [2023-11-19 08:02:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:05,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 08:02:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 08:02:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-19 08:02:05,791 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:02:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:02:06,675 INFO L93 Difference]: Finished difference Result 176 states and 231 transitions. [2023-11-19 08:02:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 08:02:06,676 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2023-11-19 08:02:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:02:06,678 INFO L225 Difference]: With dead ends: 176 [2023-11-19 08:02:06,678 INFO L226 Difference]: Without dead ends: 174 [2023-11-19 08:02:06,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2023-11-19 08:02:06,679 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 63 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 08:02:06,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 508 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 08:02:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-19 08:02:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 118. [2023-11-19 08:02:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 08:02:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2023-11-19 08:02:06,718 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 94 [2023-11-19 08:02:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:02:06,721 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2023-11-19 08:02:06,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:02:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2023-11-19 08:02:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-19 08:02:06,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:02:06,724 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:06,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:02:06,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:02:06,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:06,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1684245179, now seen corresponding path program 1 times [2023-11-19 08:02:06,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:06,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417015120] [2023-11-19 08:02:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:06,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:02:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:02:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:02:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:02:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:02:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:02:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:02:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:02:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:02:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:02:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:02:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:02:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:02:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:02:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 08:02:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417015120] [2023-11-19 08:02:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417015120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 08:02:08,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881103824] [2023-11-19 08:02:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:08,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 08:02:08,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 08:02:08,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-19 08:02:08,707 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:02:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:02:09,317 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2023-11-19 08:02:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 08:02:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2023-11-19 08:02:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:02:09,321 INFO L225 Difference]: With dead ends: 197 [2023-11-19 08:02:09,321 INFO L226 Difference]: Without dead ends: 195 [2023-11-19 08:02:09,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-11-19 08:02:09,323 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 68 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 08:02:09,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 588 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 08:02:09,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-19 08:02:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 118. [2023-11-19 08:02:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-19 08:02:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2023-11-19 08:02:09,358 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 95 [2023-11-19 08:02:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:02:09,358 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2023-11-19 08:02:09,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-19 08:02:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2023-11-19 08:02:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-19 08:02:09,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:02:09,362 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 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, 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] [2023-11-19 08:02:09,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:02:09,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:02:09,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1153313957, now seen corresponding path program 1 times [2023-11-19 08:02:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816679483] [2023-11-19 08:02:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 08:02:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 08:02:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 08:02:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 08:02:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 08:02:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-19 08:02:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:02:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-19 08:02:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-19 08:02:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-19 08:02:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-19 08:02:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-19 08:02:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 08:02:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-19 08:02:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-19 08:02:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-19 08:02:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-19 08:02:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-19 08:02:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-19 08:02:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-19 08:02:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-19 08:02:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-19 08:02:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-19 08:02:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-19 08:02:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-19 08:02:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-19 08:02:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-19 08:02:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-19 08:02:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-19 08:02:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816679483] [2023-11-19 08:02:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816679483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:02:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156793364] [2023-11-19 08:02:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:09,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:09,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:02:09,583 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:02:09,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:02:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 08:02:09,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:02:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2023-11-19 08:02:09,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:02:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156793364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:09,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 08:02:09,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-19 08:02:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889751185] [2023-11-19 08:02:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:09,879 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-19 08:02:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:02:09,937 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2023-11-19 08:02:09,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:09,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 185 [2023-11-19 08:02:09,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:02:09,938 INFO L225 Difference]: With dead ends: 156 [2023-11-19 08:02:09,938 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 08:02:09,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 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 08:02:09,940 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 08:02:09,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 118 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 08:02:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 08:02:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 08:02:09,942 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 08:02:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 08:02:09,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2023-11-19 08:02:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:02:09,943 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 08:02:09,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-19 08:02:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 08:02:09,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 08:02:09,946 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 08:02:09,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:02:10,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:02:10,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 08:02:10,616 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,616 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,616 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 87) no Hoare annotation was computed. [2023-11-19 08:02:10,616 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 08:02:10,616 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 08:02:10,616 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 08:02:10,616 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 92 104) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 08:02:10,617 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 08:02:10,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 08:02:10,618 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,618 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,618 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 88 91) no Hoare annotation was computed. [2023-11-19 08:02:10,618 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-19 08:02:10,618 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,619 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 56) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 56) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L83(lines 62 84) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-11-19 08:02:10,619 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,620 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,620 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 08:02:10,620 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-19 08:02:10,620 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2023-11-19 08:02:10,620 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 38 48) no Hoare annotation was computed. [2023-11-19 08:02:10,620 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,620 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 35) no Hoare annotation was computed. [2023-11-19 08:02:10,621 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,622 INFO L899 garLoopResultBuilder]: For program point L96-2(lines 96 102) no Hoare annotation was computed. [2023-11-19 08:02:10,622 INFO L895 garLoopResultBuilder]: At program point L96-3(lines 96 102) the Hoare annotation is: (let ((.cse4 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse4 256)) (.cse3 (* 256 (div ~var_1_12~0 256)))) (let ((.cse2 (+ .cse3 ~var_1_8~0)) (.cse1 (+ .cse0 ~var_1_12~0))) (or (and (<= 1 |ULTIMATE.start_main_~k_loop~0#1|) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 .cse2)) (and (<= (+ .cse3 ~var_1_8~0 1) .cse1) (= (+ .cse3 ~var_1_15~0) ~var_1_12~0)))) (and (<= 0 .cse4) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10) (or (let ((.cse6 (= (+ (* (div ~var_1_13~0 256) 256) ~var_1_8~0) (+ .cse0 ~var_1_13~0))) (.cse5 (+ (* 256 (div ~last_1_var_1_8~0 256)) ~var_1_7~0 ~var_1_10~0))) (and (or (< .cse5 (+ ~var_1_4~0 ~last_1_var_1_8~0 1)) (let ((.cse7 (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0))) (and (or .cse6 (not .cse7)) (or .cse7 (= .cse2 .cse1))))) (or .cse6 (< (+ ~var_1_4~0 ~last_1_var_1_8~0) .cse5)))) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))))))) [2023-11-19 08:02:10,622 INFO L899 garLoopResultBuilder]: For program point L96-4(lines 96 102) no Hoare annotation was computed. [2023-11-19 08:02:10,623 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-19 08:02:10,623 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,623 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (<= 0 (div ~var_1_8~0 256)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (<= ~var_1_8~0 10)) [2023-11-19 08:02:10,623 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-11-19 08:02:10,623 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-19 08:02:10,624 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 08:02:10,624 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 08:02:10,624 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 08:02:10,624 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 08:02:10,627 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:10,630 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:02:10,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:02:10 BoogieIcfgContainer [2023-11-19 08:02:10,653 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:02:10,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:02:10,654 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:02:10,654 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:02:10,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:50" (3/4) ... [2023-11-19 08:02:10,656 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 08:02:10,660 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 08:02:10,669 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-19 08:02:10,669 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 08:02:10,670 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 08:02:10,670 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 08:02:10,777 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:02:10,778 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 08:02:10,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:02:10,779 INFO L158 Benchmark]: Toolchain (without parser) took 21481.61ms. Allocated memory was 148.9MB in the beginning and 423.6MB in the end (delta: 274.7MB). Free memory was 103.3MB in the beginning and 189.7MB in the end (delta: -86.4MB). Peak memory consumption was 191.5MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,779 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 148.9MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:02:10,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.05ms. Allocated memory is still 148.9MB. Free memory was 103.0MB in the beginning and 90.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.14ms. Allocated memory is still 148.9MB. Free memory was 90.4MB in the beginning and 87.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,780 INFO L158 Benchmark]: Boogie Preprocessor took 57.27ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 85.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,781 INFO L158 Benchmark]: RCFGBuilder took 668.54ms. Allocated memory was 148.9MB in the beginning and 201.3MB in the end (delta: 52.4MB). Free memory was 85.8MB in the beginning and 166.6MB in the end (delta: -80.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,781 INFO L158 Benchmark]: TraceAbstraction took 20104.45ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 165.7MB in the beginning and 196.0MB in the end (delta: -30.3MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,782 INFO L158 Benchmark]: Witness Printer took 124.69ms. Allocated memory is still 423.6MB. Free memory was 196.0MB in the beginning and 189.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-19 08:02:10,784 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.30ms. Allocated memory is still 148.9MB. Free memory is still 90.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.05ms. Allocated memory is still 148.9MB. Free memory was 103.0MB in the beginning and 90.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.14ms. Allocated memory is still 148.9MB. Free memory was 90.4MB in the beginning and 87.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.27ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 85.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.54ms. Allocated memory was 148.9MB in the beginning and 201.3MB in the end (delta: 52.4MB). Free memory was 85.8MB in the beginning and 166.6MB in the end (delta: -80.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20104.45ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 165.7MB in the beginning and 196.0MB in the end (delta: -30.3MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. * Witness Printer took 124.69ms. Allocated memory is still 423.6MB. Free memory was 196.0MB in the beginning and 189.7MB 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 384 mSDsluCounter, 2044 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1380 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1004 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 664 mSDtfsCounter, 1004 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=3, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 272 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 181 PreInvPairs, 198 NumberOfFragments, 337 HoareAnnotationTreeSize, 181 FomulaSimplifications, 655 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 986 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1024 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1015 ConstructedInterpolants, 0 QuantifiedInterpolants, 3776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 5637/5638 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: 96]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && ((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12)))) || ((((0 <= (var_1_8 / 256)) && (0 <= k_loop)) && (var_1_8 <= 10)) && (((((((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10) < ((var_1_4 + last_1_var_1_8) + 1)) || ((((((var_1_13 / 256) * 256) + var_1_8) == (((var_1_8 / 256) * 256) + var_1_13)) || !((((var_1_11 / 256) * 256) == var_1_11))) && ((((var_1_11 / 256) * 256) == var_1_11) || (((256 * (var_1_12 / 256)) + var_1_8) == (((var_1_8 / 256) * 256) + var_1_12))))) && (((((var_1_13 / 256) * 256) + var_1_8) == (((var_1_8 / 256) * 256) + var_1_13)) || ((var_1_4 + last_1_var_1_8) < (((256 * (last_1_var_1_8 / 256)) + var_1_7) + var_1_10)))) || (((var_1_9 / 256) * 256) == var_1_9)))) RESULT: Ultimate proved your program to be correct! [2023-11-19 08:02:10,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7236a336-7294-4ff4-9bf7-40850b4ee8ae/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE