./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 c51b17720ce1dad8733576d816f307564aabdff8c7a86cf8d9848ed8571cafd2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:37:00,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:37:00,492 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:37:00,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:37:00,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:37:00,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:37:00,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:37:00,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:37:00,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:37:00,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:37:00,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:37:00,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:37:00,535 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:37:00,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:37:00,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:37:00,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:37:00,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:37:00,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:37:00,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:37:00,539 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:37:00,539 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:37:00,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:37:00,544 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:37:00,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:37:00,544 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:37:00,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:37:00,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:37:00,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:37:00,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:37:00,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:37:00,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:37:00,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:37:00,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:37:00,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:37:00,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:37:00,561 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:37:00,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:37:00,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:37:00,562 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:37:00,562 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_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/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_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> c51b17720ce1dad8733576d816f307564aabdff8c7a86cf8d9848ed8571cafd2 [2023-11-06 22:37:00,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:37:00,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:37:00,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:37:00,931 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:37:00,932 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:37:00,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c [2023-11-06 22:37:04,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:37:04,337 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:37:04,338 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c [2023-11-06 22:37:04,354 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/data/9ceb7291e/ec6ec97e54d241659383145688d50b6a/FLAGb0cc10cb5 [2023-11-06 22:37:04,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/data/9ceb7291e/ec6ec97e54d241659383145688d50b6a [2023-11-06 22:37:04,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:37:04,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:37:04,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:04,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:37:04,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:37:04,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311576ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04, skipping insertion in model container [2023-11-06 22:37:04,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:37:04,647 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_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c[414,427] [2023-11-06 22:37:04,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:04,686 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:37:04,702 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_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/sv-benchmarks/c/array-cav19/array_init_var_plus_ind.c[414,427] [2023-11-06 22:37:04,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:04,732 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:37:04,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04 WrapperNode [2023-11-06 22:37:04,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:04,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:04,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:37:04,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:37:04,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,779 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-06 22:37:04,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:04,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:37:04,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:37:04,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:37:04,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:37:04,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:37:04,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:37:04,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:37:04,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (1/1) ... [2023-11-06 22:37:04,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:37:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:04,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:37:04,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:37:04,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:37:04,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:37:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:37:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:37:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:37:04,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:37:04,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:37:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:37:04,997 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:37:05,000 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:37:05,213 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:37:05,220 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:37:05,220 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:37:05,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:05 BoogieIcfgContainer [2023-11-06 22:37:05,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:37:05,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:37:05,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:37:05,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:37:05,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:37:04" (1/3) ... [2023-11-06 22:37:05,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5acca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:05, skipping insertion in model container [2023-11-06 22:37:05,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:04" (2/3) ... [2023-11-06 22:37:05,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af5acca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:05, skipping insertion in model container [2023-11-06 22:37:05,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:05" (3/3) ... [2023-11-06 22:37:05,234 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_var_plus_ind.c [2023-11-06 22:37:05,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:37:05,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:37:05,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:37:05,318 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=LoopsAndPotentialCycles, 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;@5c0999c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:37:05,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:37:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-06 22:37:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:37:05,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:05,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:05,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:05,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1818270042, now seen corresponding path program 1 times [2023-11-06 22:37:05,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:05,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565374587] [2023-11-06 22:37:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:05,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565374587] [2023-11-06 22:37:05,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565374587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:05,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:05,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:37:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840592559] [2023-11-06 22:37:05,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:05,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:37:05,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:37:05,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:37:05,576 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 22:37:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:05,597 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-06 22:37:05,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:37:05,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2023-11-06 22:37:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:05,607 INFO L225 Difference]: With dead ends: 27 [2023-11-06 22:37:05,607 INFO L226 Difference]: Without dead ends: 12 [2023-11-06 22:37:05,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-06 22:37:05,614 INFO L413 NwaCegarLoop]: 18 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, 18 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-06 22:37:05,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:37:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-06 22:37:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-06 22:37:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-06 22:37:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-06 22:37:05,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2023-11-06 22:37:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:05,646 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-06 22:37:05,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 22:37:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-06 22:37:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-06 22:37:05,647 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:05,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:05,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:37:05,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:05,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1808111311, now seen corresponding path program 1 times [2023-11-06 22:37:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299827004] [2023-11-06 22:37:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:05,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:05,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:05,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299827004] [2023-11-06 22:37:05,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299827004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:37:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480272149] [2023-11-06 22:37:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:37:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:37:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:05,810 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-06 22:37:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:05,850 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-11-06 22:37:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:37:05,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2023-11-06 22:37:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:05,852 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:37:05,852 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 22:37:05,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:05,855 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:05,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:37:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 22:37:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2023-11-06 22:37:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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-06 22:37:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-06 22:37:05,863 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-11-06 22:37:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:05,863 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-06 22:37:05,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-06 22:37:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-06 22:37:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:37:05,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:05,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:05,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:37:05,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:05,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 266504688, now seen corresponding path program 1 times [2023-11-06 22:37:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69978714] [2023-11-06 22:37:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69978714] [2023-11-06 22:37:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69978714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:06,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:06,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:06,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058717535] [2023-11-06 22:37:06,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:06,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:37:06,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:37:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:06,051 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-06 22:37:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:06,107 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-11-06 22:37:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:37:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2023-11-06 22:37:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:06,109 INFO L225 Difference]: With dead ends: 23 [2023-11-06 22:37:06,109 INFO L226 Difference]: Without dead ends: 15 [2023-11-06 22:37:06,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:06,113 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:06,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:37:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-06 22:37:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-11-06 22:37:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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-06 22:37:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-06 22:37:06,129 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2023-11-06 22:37:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:06,129 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-06 22:37:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-06 22:37:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-06 22:37:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:37:06,133 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:06,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:06,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:37:06,160 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:06,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 53732745, now seen corresponding path program 1 times [2023-11-06 22:37:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358974406] [2023-11-06 22:37:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358974406] [2023-11-06 22:37:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358974406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013907613] [2023-11-06 22:37:06,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:06,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:06,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:37:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:06,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:37:06,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:06,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013907613] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:06,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-11-06 22:37:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656833584] [2023-11-06 22:37:06,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:06,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:37:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:06,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:37:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:06,757 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-06 22:37:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:06,916 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-11-06 22:37:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:37:06,917 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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) Word has length 10 [2023-11-06 22:37:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:06,918 INFO L225 Difference]: With dead ends: 45 [2023-11-06 22:37:06,918 INFO L226 Difference]: Without dead ends: 36 [2023-11-06 22:37:06,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:37:06,921 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 98 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:06,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 52 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:37:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-06 22:37:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2023-11-06 22:37:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-06 22:37:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-06 22:37:06,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2023-11-06 22:37:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:06,930 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 22:37:06,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-06 22:37:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-06 22:37:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:37:06,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:06,932 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:06,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:07,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:07,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:07,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -334334928, now seen corresponding path program 1 times [2023-11-06 22:37:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:07,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891669796] [2023-11-06 22:37:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891669796] [2023-11-06 22:37:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891669796] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:07,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859538037] [2023-11-06 22:37:07,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:07,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:07,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:07,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:07,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:37:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:07,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-06 22:37:07,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:07,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:37:08,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:37:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:08,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:08,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-06 22:37:08,204 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-11-06 22:37:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859538037] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:08,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2023-11-06 22:37:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300059660] [2023-11-06 22:37:08,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:08,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:37:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:37:08,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:37:08,280 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-06 22:37:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:08,479 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-11-06 22:37:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:37:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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) Word has length 14 [2023-11-06 22:37:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:08,480 INFO L225 Difference]: With dead ends: 35 [2023-11-06 22:37:08,480 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:37:08,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:37:08,482 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:08,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:37:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:37:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2023-11-06 22:37:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-06 22:37:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-06 22:37:08,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2023-11-06 22:37:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:08,492 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-06 22:37:08,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-06 22:37:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-06 22:37:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-06 22:37:08,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:08,493 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:08,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:08,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:08,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:08,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash -768933834, now seen corresponding path program 2 times [2023-11-06 22:37:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617979166] [2023-11-06 22:37:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:09,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617979166] [2023-11-06 22:37:09,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617979166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:09,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513419107] [2023-11-06 22:37:09,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:09,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:09,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:09,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:09,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:37:09,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:09,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:09,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-06 22:37:09,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:09,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:37:09,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:09,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-06 22:37:09,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 22:37:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:09,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:09,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-06 22:37:09,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2023-11-06 22:37:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513419107] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:09,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:09,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-11-06 22:37:09,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754723821] [2023-11-06 22:37:09,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:09,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:37:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:09,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:37:09,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2023-11-06 22:37:09,979 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-06 22:37:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:10,279 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-11-06 22:37:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:37:10,281 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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) Word has length 17 [2023-11-06 22:37:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:10,286 INFO L225 Difference]: With dead ends: 31 [2023-11-06 22:37:10,286 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:37:10,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2023-11-06 22:37:10,289 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:10,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 72 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:37:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:37:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-06 22:37:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-06 22:37:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 22:37:10,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2023-11-06 22:37:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:10,301 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 22:37:10,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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-06 22:37:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 22:37:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:37:10,303 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:10,303 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:10,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:10,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:37:10,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:10,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 20881638, now seen corresponding path program 1 times [2023-11-06 22:37:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227801945] [2023-11-06 22:37:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227801945] [2023-11-06 22:37:10,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227801945] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:10,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032519913] [2023-11-06 22:37:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:10,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:10,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:10,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:37:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:10,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:37:10,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:10,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032519913] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:10,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 22:37:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748120315] [2023-11-06 22:37:10,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 22:37:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 22:37:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:10,824 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-06 22:37:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:10,887 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-06 22:37:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:10,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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) Word has length 18 [2023-11-06 22:37:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:10,889 INFO L225 Difference]: With dead ends: 36 [2023-11-06 22:37:10,889 INFO L226 Difference]: Without dead ends: 24 [2023-11-06 22:37:10,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:37:10,891 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:10,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:37:10,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-06 22:37:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-06 22:37:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 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-06 22:37:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-06 22:37:10,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2023-11-06 22:37:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:10,898 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-06 22:37:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-06 22:37:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-06 22:37:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:37:10,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:37:10,900 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:10,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:11,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:37:11,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -796542484, now seen corresponding path program 2 times [2023-11-06 22:37:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170927559] [2023-11-06 22:37:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170927559] [2023-11-06 22:37:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170927559] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852913106] [2023-11-06 22:37:11,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:37:11,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:11,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:11,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:11,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:37:11,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:37:11,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:37:11,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:37:11,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:11,771 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:37:11,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:37:12,191 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:12,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2023-11-06 22:37:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:12,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:12,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 22:37:12,986 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:37:12,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 99 [2023-11-06 22:37:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852913106] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:13,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:13,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 33 [2023-11-06 22:37:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715360291] [2023-11-06 22:37:13,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-06 22:37:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-06 22:37:13,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2023-11-06 22:37:13,257 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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-06 22:37:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:37:14,506 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-11-06 22:37:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:37:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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) Word has length 21 [2023-11-06 22:37:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:37:14,508 INFO L225 Difference]: With dead ends: 37 [2023-11-06 22:37:14,509 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:37:14,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2023-11-06 22:37:14,511 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:37:14,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:37:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:37:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:37:14,512 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-06 22:37:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:37:14,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2023-11-06 22:37:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:37:14,513 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:37:14,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 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-06 22:37:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:37:14,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:37:14,519 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:37:14,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:14,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:37:15,243 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:37:15,243 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:37:15,243 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:37:15,243 INFO L895 garLoopResultBuilder]: At program point L17-3(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 100000 ~N~0)) (.cse1 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~j~0#1| 0))) (or (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse1 .cse2) (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|))) (and (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~k~0#1_20| Int)) (let ((.cse3 (store .cse4 (* |ULTIMATE.start_main_~i~0#1| 4) v_ArrVal_80))) (or (< (select .cse3 4) 0) (< 0 (+ (select .cse3 (* 4 |v_ULTIMATE.start_main_~k~0#1_20|)) 1)) (< v_ArrVal_80 |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_20|) (< |v_ULTIMATE.start_main_~k~0#1_20| 2)))) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse0 .cse1 (= (select .cse4 4) 0))) (and (= |ULTIMATE.start_main_~i~0#1| 1) .cse0 .cse1 .cse2))) [2023-11-06 22:37:15,243 INFO L899 garLoopResultBuilder]: For program point L17-4(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:37:15,244 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:37:15,244 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 11 27) the Hoare annotation is: true [2023-11-06 22:37:15,244 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:37:15,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:37:15,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-11-06 22:37:15,244 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 25) no Hoare annotation was computed. [2023-11-06 22:37:15,245 INFO L895 garLoopResultBuilder]: At program point L24-3(lines 24 25) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|))) (let ((.cse6 (= 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (= |ULTIMATE.start_main_~#a~0#1.offset| 0)) (.cse5 (= (select .cse0 4) 0)) (.cse7 (= |ULTIMATE.start_main_~k~0#1| 1)) (.cse3 (<= 100000 ~N~0))) (or (let ((.cse1 (+ |ULTIMATE.start_main_~k~0#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~k~0#1_20| Int)) (or (< 0 (+ (select .cse0 (* 4 |v_ULTIMATE.start_main_~k~0#1_20|)) 1)) (< |v_ULTIMATE.start_main_~k~0#1_20| .cse1) (< |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~k~0#1_20| 1)))) (forall ((v_ArrVal_80 Int) (|v_ULTIMATE.start_main_~k~0#1_20| Int)) (let ((.cse2 (store .cse0 (* |ULTIMATE.start_main_~i~0#1| 4) v_ArrVal_80))) (or (< (select .cse2 4) 0) (< 0 (+ (select .cse2 (* 4 |v_ULTIMATE.start_main_~k~0#1_20|)) 1)) (< v_ArrVal_80 |ULTIMATE.start_main_~j~0#1|) (< |ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~k~0#1_20|) (< |v_ULTIMATE.start_main_~k~0#1_20| 2)))) (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse3 .cse4 .cse5 (or (< |ULTIMATE.start_main_~i~0#1| .cse1) (< 0 (+ (select .cse0 (* |ULTIMATE.start_main_~k~0#1| 4)) 1))))) (and (<= 2 |ULTIMATE.start_main_~k~0#1|) .cse6 .cse3 .cse4 .cse5) (and .cse7 .cse6 .cse3 .cse4 .cse5) (and .cse7 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 1))))) [2023-11-06 22:37:15,245 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 25) no Hoare annotation was computed. [2023-11-06 22:37:15,245 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-11-06 22:37:15,245 INFO L899 garLoopResultBuilder]: For program point L8-1(line 8) no Hoare annotation was computed. [2023-11-06 22:37:15,245 INFO L899 garLoopResultBuilder]: For program point L8-3(line 8) no Hoare annotation was computed. [2023-11-06 22:37:15,249 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-06 22:37:15,251 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:37:15,267 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,268 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,269 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,271 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,271 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,271 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,280 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated [2023-11-06 22:37:15,281 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,282 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,283 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated [2023-11-06 22:37:15,284 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,284 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,285 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,285 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,287 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated [2023-11-06 22:37:15,294 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,295 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,295 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,296 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,296 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated [2023-11-06 22:37:15,296 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,297 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,304 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,304 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:37:15 BoogieIcfgContainer [2023-11-06 22:37:15,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:37:15,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:37:15,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:37:15,306 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:37:15,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:05" (3/4) ... [2023-11-06 22:37:15,310 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:37:15,320 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-06 22:37:15,321 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:37:15,321 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:37:15,321 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:37:15,387 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:37:15,387 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:37:15,388 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:37:15,388 INFO L158 Benchmark]: Toolchain (without parser) took 11002.47ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 112.5MB in the beginning and 131.3MB in the end (delta: -18.9MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,389 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:37:15,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.75ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 101.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.86ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,390 INFO L158 Benchmark]: Boogie Preprocessor took 26.06ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 98.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:37:15,391 INFO L158 Benchmark]: RCFGBuilder took 415.68ms. Allocated memory is still 159.4MB. Free memory was 98.7MB in the beginning and 88.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,391 INFO L158 Benchmark]: TraceAbstraction took 10079.05ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 87.9MB in the beginning and 134.5MB in the end (delta: -46.6MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,391 INFO L158 Benchmark]: Witness Printer took 82.08ms. Allocated memory is still 203.4MB. Free memory was 134.5MB in the beginning and 131.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:37:15,394 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.29ms. Allocated memory is still 159.4MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.75ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 101.3MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.86ms. Allocated memory is still 159.4MB. Free memory was 101.3MB in the beginning and 99.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.06ms. Allocated memory is still 159.4MB. Free memory was 99.9MB in the beginning and 98.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 415.68ms. Allocated memory is still 159.4MB. Free memory was 98.7MB in the beginning and 88.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10079.05ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 87.9MB in the beginning and 134.5MB in the end (delta: -46.6MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 82.08ms. Allocated memory is still 203.4MB. Free memory was 134.5MB in the beginning and 131.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated * 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: 8]: 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 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 275 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 629 IncrementalHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 78 mSDtfsCounter, 629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=5, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 37 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 16 NumberOfFragments, 231 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1113 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 283 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 244 ConstructedInterpolants, 14 QuantifiedInterpolants, 2145 SizeOfPredicates, 34 NumberOfNonLiveVariables, 437 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 5/147 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: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2023-11-06 22:37:15,417 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,417 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,417 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,418 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,418 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,418 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated Derived loop invariant: (((((i == 0) && (100000 <= N)) && (j == 0)) || ((2 <= i) && (100000 <= N))) || (((i == 1) && (100000 <= N)) && (j == 0))) - InvariantResult [Line: 24]: Loop Invariant [2023-11-06 22:37:15,419 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated [2023-11-06 22:37:15,419 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,420 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,420 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,420 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,420 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated [2023-11-06 22:37:15,420 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,421 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,421 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,421 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,422 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ULTIMATE.start_main_~k~0#1_20 : int :: (0 < #memory_int[~#a~0!base][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1 || v_ULTIMATE.start_main_~k~0#1_20 < ~k~0 + 1) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20 + 1) could not be translated [2023-11-06 22:37:15,422 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (forall v_ArrVal_80 : int, v_ULTIMATE.start_main_~k~0#1_20 : int :: (((#memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4] < 0 || 0 < #memory_int[~#a~0!base][~i~0 * 4 := v_ArrVal_80][4 * v_ULTIMATE.start_main_~k~0#1_20] + 1) || v_ArrVal_80 < ~j~0) || ~i~0 < v_ULTIMATE.start_main_~k~0#1_20) || v_ULTIMATE.start_main_~k~0#1_20 < 2) could not be translated [2023-11-06 22:37:15,422 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,422 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,422 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,423 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][~k~0 * 4] could not be translated [2023-11-06 22:37:15,423 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,423 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated [2023-11-06 22:37:15,423 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base] could not be translated [2023-11-06 22:37:15,423 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#a~0!base][4] could not be translated Derived loop invariant: (((((2 <= i) && (100000 <= N)) || (((2 <= k) && (2 == i)) && (100000 <= N))) || (((k == 1) && (2 == i)) && (100000 <= N))) || (((k == 1) && (100000 <= N)) && (i <= 1))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:37:15,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aebcb453-cf8e-4c3c-a1a4-8d73187c3d11/bin/uautomizer-verify-WvqO1wxjHP/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