./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i --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_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/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_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/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_6a297d38-55b7-4525-8783-a88f1fed5cb0/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 dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:24:12,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:24:12,245 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:24:12,255 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:24:12,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:24:12,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:24:12,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:24:12,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:24:12,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:24:12,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:24:12,305 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:24:12,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:24:12,306 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:24:12,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:24:12,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:24:12,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:24:12,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:24:12,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:24:12,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:24:12,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:24:12,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:24:12,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:24:12,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:24:12,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:24:12,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:24:12,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:24:12,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:24:12,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:24:12,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:12,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:24:12,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:24:12,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:24:12,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:24:12,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:24:12,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:24:12,320 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:24:12,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:24:12,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:24:12,341 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:24:12,342 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_6a297d38-55b7-4525-8783-a88f1fed5cb0/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_6a297d38-55b7-4525-8783-a88f1fed5cb0/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 -> dd98e02a958c2e630fe387017d194cc2d0adeeb7f7dbaa6eeae7739b76f0d917 [2023-11-06 22:24:12,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:24:12,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:24:12,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:24:12,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:24:12,758 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:24:12,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2023-11-06 22:24:15,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:24:16,136 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:24:16,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i [2023-11-06 22:24:16,149 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/data/0a19a63d4/9d85b2e24f124076a5c8825e67ab2128/FLAG4c7f133c6 [2023-11-06 22:24:16,169 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/data/0a19a63d4/9d85b2e24f124076a5c8825e67ab2128 [2023-11-06 22:24:16,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:24:16,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:24:16,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:16,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:24:16,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:24:16,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5910ec88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16, skipping insertion in model container [2023-11-06 22:24:16,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,228 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:24:16,399 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_6a297d38-55b7-4525-8783-a88f1fed5cb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2023-11-06 22:24:16,474 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:16,507 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:24:16,520 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_6a297d38-55b7-4525-8783-a88f1fed5cb0/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-76.i[916,929] [2023-11-06 22:24:16,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:24:16,580 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:24:16,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16 WrapperNode [2023-11-06 22:24:16,580 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:24:16,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:16,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:24:16,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:24:16,590 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:24:16" (1/1) ... [2023-11-06 22:24:16,606 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:24:16" (1/1) ... [2023-11-06 22:24:16,659 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 370 [2023-11-06 22:24:16,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:24:16,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:24:16,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:24:16,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:24:16,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:24:16,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:24:16,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:24:16,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:24:16,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (1/1) ... [2023-11-06 22:24:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:24:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:16,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/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:24:16,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/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:24:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:24:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:24:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:24:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:24:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:24:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:24:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:24:16,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:24:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:24:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:24:16,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:24:16,929 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:24:16,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:24:17,585 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:24:17,601 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:24:17,601 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:24:17,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:17 BoogieIcfgContainer [2023-11-06 22:24:17,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:24:17,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:24:17,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:24:17,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:24:17,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:16" (1/3) ... [2023-11-06 22:24:17,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a5327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:17, skipping insertion in model container [2023-11-06 22:24:17,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16" (2/3) ... [2023-11-06 22:24:17,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5a5327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:17, skipping insertion in model container [2023-11-06 22:24:17,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:17" (3/3) ... [2023-11-06 22:24:17,617 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-76.i [2023-11-06 22:24:17,637 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:24:17,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:24:17,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:24:17,699 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;@68384bc6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:24:17,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:24:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:24:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:24:17,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:17,720 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:17,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:17,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 587591641, now seen corresponding path program 1 times [2023-11-06 22:24:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:17,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475859605] [2023-11-06 22:24:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475859605] [2023-11-06 22:24:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475859605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:24:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310195218] [2023-11-06 22:24:18,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:18,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:24:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:18,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:24:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:24:18,262 INFO L87 Difference]: Start difference. First operand has 102 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:24:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:18,300 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2023-11-06 22:24:18,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:24:18,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-11-06 22:24:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:18,312 INFO L225 Difference]: With dead ends: 193 [2023-11-06 22:24:18,312 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:24:18,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:24:18,321 INFO L413 NwaCegarLoop]: 133 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, 133 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:24:18,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:24:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 22:24:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:24:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2023-11-06 22:24:18,375 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2023-11-06 22:24:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:18,376 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2023-11-06 22:24:18,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-06 22:24:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2023-11-06 22:24:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:24:18,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:18,381 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:18,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:24:18,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:18,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash 46939881, now seen corresponding path program 1 times [2023-11-06 22:24:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519696347] [2023-11-06 22:24:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:19,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:19,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519696347] [2023-11-06 22:24:19,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519696347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:19,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:19,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980599012] [2023-11-06 22:24:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:19,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:19,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:19,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:19,089 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:19,130 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2023-11-06 22:24:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-11-06 22:24:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:19,134 INFO L225 Difference]: With dead ends: 185 [2023-11-06 22:24:19,137 INFO L226 Difference]: Without dead ends: 94 [2023-11-06 22:24:19,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:19,141 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:19,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-06 22:24:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-06 22:24:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:24:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-11-06 22:24:19,178 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2023-11-06 22:24:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:19,180 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-11-06 22:24:19,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-11-06 22:24:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:24:19,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:19,184 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:19,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:24:19,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:19,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 122299919, now seen corresponding path program 1 times [2023-11-06 22:24:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027757957] [2023-11-06 22:24:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027757957] [2023-11-06 22:24:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027757957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:19,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:19,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:19,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154723714] [2023-11-06 22:24:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:19,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:24:19,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:24:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:19,573 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:19,746 INFO L93 Difference]: Finished difference Result 186 states and 262 transitions. [2023-11-06 22:24:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:19,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-06 22:24:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:19,753 INFO L225 Difference]: With dead ends: 186 [2023-11-06 22:24:19,753 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:24:19,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:24:19,755 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 26 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:19,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 311 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:24:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-06 22:24:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 22:24:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2023-11-06 22:24:19,775 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 131 transitions. Word has length 120 [2023-11-06 22:24:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:19,775 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 131 transitions. [2023-11-06 22:24:19,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2023-11-06 22:24:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-06 22:24:19,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:19,784 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:19,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:24:19,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:19,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 545001745, now seen corresponding path program 1 times [2023-11-06 22:24:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481499312] [2023-11-06 22:24:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481499312] [2023-11-06 22:24:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481499312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:24:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441097496] [2023-11-06 22:24:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:20,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:24:20,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:24:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:20,945 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:21,449 INFO L93 Difference]: Finished difference Result 234 states and 325 transitions. [2023-11-06 22:24:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-11-06 22:24:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:21,452 INFO L225 Difference]: With dead ends: 234 [2023-11-06 22:24:21,452 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 22:24:21,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:24:21,455 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 200 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:21,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 417 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:24:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 22:24:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2023-11-06 22:24:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 121 states have internal predecessors, (160), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:24:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2023-11-06 22:24:21,472 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 120 [2023-11-06 22:24:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:21,473 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2023-11-06 22:24:21,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2023-11-06 22:24:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:24:21,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:21,476 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:21,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:24:21,476 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:21,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:21,477 INFO L85 PathProgramCache]: Analyzing trace with hash -185142692, now seen corresponding path program 1 times [2023-11-06 22:24:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:21,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060348836] [2023-11-06 22:24:21,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:21,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060348836] [2023-11-06 22:24:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060348836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419671458] [2023-11-06 22:24:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:21,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:21,693 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:21,712 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2023-11-06 22:24:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:24:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:21,716 INFO L225 Difference]: With dead ends: 295 [2023-11-06 22:24:21,716 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:24:21,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:21,718 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 33 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:21,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:24:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2023-11-06 22:24:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 121 states have internal predecessors, (158), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 22:24:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2023-11-06 22:24:21,735 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 122 [2023-11-06 22:24:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:21,736 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2023-11-06 22:24:21,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2023-11-06 22:24:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-06 22:24:21,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:21,738 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:21,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:24:21,739 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:21,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash 569522220, now seen corresponding path program 1 times [2023-11-06 22:24:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:21,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015055514] [2023-11-06 22:24:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015055514] [2023-11-06 22:24:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015055514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468992330] [2023-11-06 22:24:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:22,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:22,325 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:22,864 INFO L93 Difference]: Finished difference Result 295 states and 403 transitions. [2023-11-06 22:24:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2023-11-06 22:24:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:22,866 INFO L225 Difference]: With dead ends: 295 [2023-11-06 22:24:22,867 INFO L226 Difference]: Without dead ends: 158 [2023-11-06 22:24:22,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:22,868 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 169 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:22,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 385 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:24:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-06 22:24:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2023-11-06 22:24:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3053435114503817) internal successors, (171), 132 states have internal predecessors, (171), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:24:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 211 transitions. [2023-11-06 22:24:22,900 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 211 transitions. Word has length 122 [2023-11-06 22:24:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:22,902 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 211 transitions. [2023-11-06 22:24:22,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 211 transitions. [2023-11-06 22:24:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:24:22,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:22,904 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:22,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:24:22,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:22,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash 364991370, now seen corresponding path program 1 times [2023-11-06 22:24:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:22,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106545506] [2023-11-06 22:24:22,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:23,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:23,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106545506] [2023-11-06 22:24:23,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106545506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:24:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953691181] [2023-11-06 22:24:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:23,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:23,222 INFO L87 Difference]: Start difference. First operand 155 states and 211 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:23,317 INFO L93 Difference]: Finished difference Result 347 states and 475 transitions. [2023-11-06 22:24:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:24:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:23,320 INFO L225 Difference]: With dead ends: 347 [2023-11-06 22:24:23,320 INFO L226 Difference]: Without dead ends: 195 [2023-11-06 22:24:23,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:23,325 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 98 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:23,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-06 22:24:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2023-11-06 22:24:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 140 states have internal predecessors, (179), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:24:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 219 transitions. [2023-11-06 22:24:23,352 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 219 transitions. Word has length 124 [2023-11-06 22:24:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:23,353 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 219 transitions. [2023-11-06 22:24:23,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 219 transitions. [2023-11-06 22:24:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:24:23,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:23,355 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:23,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:24:23,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:23,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,356 INFO L85 PathProgramCache]: Analyzing trace with hash 670312422, now seen corresponding path program 1 times [2023-11-06 22:24:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795521750] [2023-11-06 22:24:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:23,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:23,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795521750] [2023-11-06 22:24:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795521750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:23,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:24:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114262593] [2023-11-06 22:24:23,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:23,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:24:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:24:23,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:23,524 INFO L87 Difference]: Start difference. First operand 163 states and 219 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:23,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:23,555 INFO L93 Difference]: Finished difference Result 325 states and 439 transitions. [2023-11-06 22:24:23,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:24:23,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2023-11-06 22:24:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:23,558 INFO L225 Difference]: With dead ends: 325 [2023-11-06 22:24:23,558 INFO L226 Difference]: Without dead ends: 165 [2023-11-06 22:24:23,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:24:23,561 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:23,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-06 22:24:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-11-06 22:24:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 142 states have internal predecessors, (181), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:24:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2023-11-06 22:24:23,586 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 124 [2023-11-06 22:24:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:23,587 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2023-11-06 22:24:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2023-11-06 22:24:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-06 22:24:23,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:23,589 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:23,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:24:23,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:23,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:23,590 INFO L85 PathProgramCache]: Analyzing trace with hash -340804828, now seen corresponding path program 1 times [2023-11-06 22:24:23,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:23,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787239425] [2023-11-06 22:24:23,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:23,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787239425] [2023-11-06 22:24:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787239425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:24:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304211315] [2023-11-06 22:24:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:24,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:24:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:24:24,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:24:24,992 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:24:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:25,899 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2023-11-06 22:24:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:25,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2023-11-06 22:24:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:25,902 INFO L225 Difference]: With dead ends: 384 [2023-11-06 22:24:25,902 INFO L226 Difference]: Without dead ends: 222 [2023-11-06 22:24:25,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:24:25,905 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 275 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:25,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 409 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:24:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-06 22:24:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2023-11-06 22:24:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.2620689655172415) internal successors, (183), 147 states have internal predecessors, (183), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:24:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 227 transitions. [2023-11-06 22:24:25,938 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 227 transitions. Word has length 124 [2023-11-06 22:24:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:25,939 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 227 transitions. [2023-11-06 22:24:25,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-06 22:24:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 227 transitions. [2023-11-06 22:24:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:24:25,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:25,941 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:25,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:24:25,942 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:25,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -559895515, now seen corresponding path program 1 times [2023-11-06 22:24:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:25,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042694521] [2023-11-06 22:24:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042694521] [2023-11-06 22:24:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042694521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:26,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:26,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:26,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034733974] [2023-11-06 22:24:26,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:26,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:26,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:26,447 INFO L87 Difference]: Start difference. First operand 172 states and 227 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:26,735 INFO L93 Difference]: Finished difference Result 352 states and 463 transitions. [2023-11-06 22:24:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-06 22:24:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:26,738 INFO L225 Difference]: With dead ends: 352 [2023-11-06 22:24:26,738 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 22:24:26,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:26,739 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 107 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:26,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 455 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 22:24:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2023-11-06 22:24:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 144 states have internal predecessors, (177), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:24:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2023-11-06 22:24:26,777 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 126 [2023-11-06 22:24:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:26,778 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2023-11-06 22:24:26,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:26,778 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2023-11-06 22:24:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-06 22:24:26,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:26,780 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:26,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:24:26,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:26,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -12053055, now seen corresponding path program 1 times [2023-11-06 22:24:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763776339] [2023-11-06 22:24:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763776339] [2023-11-06 22:24:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763776339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:27,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:24:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898305385] [2023-11-06 22:24:27,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:27,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:24:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:27,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:24:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:24:27,983 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:28,497 INFO L93 Difference]: Finished difference Result 333 states and 433 transitions. [2023-11-06 22:24:28,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:28,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2023-11-06 22:24:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:28,500 INFO L225 Difference]: With dead ends: 333 [2023-11-06 22:24:28,500 INFO L226 Difference]: Without dead ends: 171 [2023-11-06 22:24:28,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:24:28,502 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 249 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:28,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 315 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:24:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-06 22:24:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2023-11-06 22:24:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 144 states have internal predecessors, (176), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:24:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2023-11-06 22:24:28,532 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 126 [2023-11-06 22:24:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:28,535 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2023-11-06 22:24:28,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2023-11-06 22:24:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-06 22:24:28,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:28,538 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:28,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:24:28,538 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:28,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 991290289, now seen corresponding path program 1 times [2023-11-06 22:24:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499292624] [2023-11-06 22:24:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499292624] [2023-11-06 22:24:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499292624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 22:24:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515243334] [2023-11-06 22:24:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:29,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:24:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:24:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:29,794 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:30,397 INFO L93 Difference]: Finished difference Result 404 states and 521 transitions. [2023-11-06 22:24:30,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:24:30,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2023-11-06 22:24:30,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:30,400 INFO L225 Difference]: With dead ends: 404 [2023-11-06 22:24:30,400 INFO L226 Difference]: Without dead ends: 242 [2023-11-06 22:24:30,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:24:30,402 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 282 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:30,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 615 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:24:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-11-06 22:24:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 195. [2023-11-06 22:24:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 167 states have (on average 1.2335329341317365) internal successors, (206), 169 states have internal predecessors, (206), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:24:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 250 transitions. [2023-11-06 22:24:30,434 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 250 transitions. Word has length 128 [2023-11-06 22:24:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:30,434 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 250 transitions. [2023-11-06 22:24:30,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 250 transitions. [2023-11-06 22:24:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:24:30,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:30,437 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:30,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:24:30,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:30,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:30,438 INFO L85 PathProgramCache]: Analyzing trace with hash 5207653, now seen corresponding path program 1 times [2023-11-06 22:24:30,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:30,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341334898] [2023-11-06 22:24:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:30,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341334898] [2023-11-06 22:24:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341334898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:30,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:30,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014342705] [2023-11-06 22:24:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:30,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:30,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:30,830 INFO L87 Difference]: Start difference. First operand 195 states and 250 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:31,248 INFO L93 Difference]: Finished difference Result 475 states and 608 transitions. [2023-11-06 22:24:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-06 22:24:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:31,252 INFO L225 Difference]: With dead ends: 475 [2023-11-06 22:24:31,252 INFO L226 Difference]: Without dead ends: 288 [2023-11-06 22:24:31,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:31,253 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 212 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:31,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 380 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:24:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-06 22:24:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 224. [2023-11-06 22:24:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 193 states have (on average 1.2227979274611398) internal successors, (236), 195 states have internal predecessors, (236), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:24:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2023-11-06 22:24:31,288 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 129 [2023-11-06 22:24:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:31,289 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2023-11-06 22:24:31,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2023-11-06 22:24:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:24:31,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:31,291 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:31,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:24:31,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:31,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -56831961, now seen corresponding path program 1 times [2023-11-06 22:24:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727217206] [2023-11-06 22:24:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727217206] [2023-11-06 22:24:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727217206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111622083] [2023-11-06 22:24:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:31,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:31,823 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:32,257 INFO L93 Difference]: Finished difference Result 492 states and 627 transitions. [2023-11-06 22:24:32,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:32,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2023-11-06 22:24:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:32,262 INFO L225 Difference]: With dead ends: 492 [2023-11-06 22:24:32,262 INFO L226 Difference]: Without dead ends: 284 [2023-11-06 22:24:32,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:32,263 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 215 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:32,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 377 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:24:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-06 22:24:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 203. [2023-11-06 22:24:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.2209302325581395) internal successors, (210), 174 states have internal predecessors, (210), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:24:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 258 transitions. [2023-11-06 22:24:32,304 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 258 transitions. Word has length 129 [2023-11-06 22:24:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:32,305 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 258 transitions. [2023-11-06 22:24:32,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 258 transitions. [2023-11-06 22:24:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:24:32,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:32,307 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:32,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:24:32,308 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:32,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash -998036650, now seen corresponding path program 1 times [2023-11-06 22:24:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:32,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259107646] [2023-11-06 22:24:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259107646] [2023-11-06 22:24:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259107646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:33,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:33,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148327924] [2023-11-06 22:24:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:33,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:33,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:33,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:33,011 INFO L87 Difference]: Start difference. First operand 203 states and 258 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:33,326 INFO L93 Difference]: Finished difference Result 333 states and 426 transitions. [2023-11-06 22:24:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:24:33,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-11-06 22:24:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:33,329 INFO L225 Difference]: With dead ends: 333 [2023-11-06 22:24:33,330 INFO L226 Difference]: Without dead ends: 331 [2023-11-06 22:24:33,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:24:33,332 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 104 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:33,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 982 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-11-06 22:24:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 242. [2023-11-06 22:24:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.1990521327014219) internal successors, (253), 213 states have internal predecessors, (253), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:24:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 301 transitions. [2023-11-06 22:24:33,376 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 301 transitions. Word has length 130 [2023-11-06 22:24:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:33,376 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 301 transitions. [2023-11-06 22:24:33,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 301 transitions. [2023-11-06 22:24:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 22:24:33,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:33,379 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:33,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:24:33,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:33,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -767295561, now seen corresponding path program 1 times [2023-11-06 22:24:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860516205] [2023-11-06 22:24:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860516205] [2023-11-06 22:24:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860516205] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:33,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632344546] [2023-11-06 22:24:33,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:33,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:33,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:33,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:33,904 INFO L87 Difference]: Start difference. First operand 242 states and 301 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:34,328 INFO L93 Difference]: Finished difference Result 518 states and 646 transitions. [2023-11-06 22:24:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2023-11-06 22:24:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:34,333 INFO L225 Difference]: With dead ends: 518 [2023-11-06 22:24:34,334 INFO L226 Difference]: Without dead ends: 292 [2023-11-06 22:24:34,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:24:34,336 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 212 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:34,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 317 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:24:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-11-06 22:24:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 242. [2023-11-06 22:24:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 211 states have (on average 1.1895734597156398) internal successors, (251), 213 states have internal predecessors, (251), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-06 22:24:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 299 transitions. [2023-11-06 22:24:34,380 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 299 transitions. Word has length 130 [2023-11-06 22:24:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:34,381 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 299 transitions. [2023-11-06 22:24:34,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 299 transitions. [2023-11-06 22:24:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:24:34,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:34,383 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:34,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:24:34,384 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:34,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:34,384 INFO L85 PathProgramCache]: Analyzing trace with hash 795063659, now seen corresponding path program 1 times [2023-11-06 22:24:34,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:34,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383136214] [2023-11-06 22:24:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:34,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:34,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383136214] [2023-11-06 22:24:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383136214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:34,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105204570] [2023-11-06 22:24:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:34,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:34,682 INFO L87 Difference]: Start difference. First operand 242 states and 299 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:34,966 INFO L93 Difference]: Finished difference Result 543 states and 678 transitions. [2023-11-06 22:24:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:34,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:24:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:34,969 INFO L225 Difference]: With dead ends: 543 [2023-11-06 22:24:34,969 INFO L226 Difference]: Without dead ends: 317 [2023-11-06 22:24:34,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:24:34,971 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 133 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:34,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 411 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-06 22:24:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2023-11-06 22:24:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 241 states have (on average 1.1867219917012448) internal successors, (286), 244 states have internal predecessors, (286), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:24:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2023-11-06 22:24:35,020 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 131 [2023-11-06 22:24:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:35,020 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2023-11-06 22:24:35,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2023-11-06 22:24:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-06 22:24:35,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:35,024 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:35,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:24:35,024 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:35,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:35,025 INFO L85 PathProgramCache]: Analyzing trace with hash 402036649, now seen corresponding path program 1 times [2023-11-06 22:24:35,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81897400] [2023-11-06 22:24:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81897400] [2023-11-06 22:24:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81897400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:24:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770393974] [2023-11-06 22:24:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:35,263 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:35,380 INFO L93 Difference]: Finished difference Result 576 states and 716 transitions. [2023-11-06 22:24:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:24:35,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2023-11-06 22:24:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:35,383 INFO L225 Difference]: With dead ends: 576 [2023-11-06 22:24:35,383 INFO L226 Difference]: Without dead ends: 314 [2023-11-06 22:24:35,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:24:35,385 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 76 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:35,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 728 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:24:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-06 22:24:35,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 279. [2023-11-06 22:24:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 242 states have (on average 1.177685950413223) internal successors, (285), 245 states have internal predecessors, (285), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:24:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 341 transitions. [2023-11-06 22:24:35,428 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 341 transitions. Word has length 131 [2023-11-06 22:24:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:35,428 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 341 transitions. [2023-11-06 22:24:35,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 341 transitions. [2023-11-06 22:24:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-06 22:24:35,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:35,431 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:35,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:24:35,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:35,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1805806805, now seen corresponding path program 1 times [2023-11-06 22:24:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:35,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324564628] [2023-11-06 22:24:35,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-11-06 22:24:36,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324564628] [2023-11-06 22:24:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324564628] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677160335] [2023-11-06 22:24:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:36,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:36,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:24:36,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:24:36,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:24:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:36,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:24:36,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:37,169 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 19 treesize of output 1 [2023-11-06 22:24:37,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:37,527 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 20 treesize of output 15 [2023-11-06 22:24:37,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:37,685 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 20 treesize of output 15 [2023-11-06 22:24:37,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:37,896 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 20 treesize of output 15 [2023-11-06 22:24:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:38,112 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 20 treesize of output 15 [2023-11-06 22:24:38,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:38,324 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 20 treesize of output 15 [2023-11-06 22:24:38,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:38,524 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 20 treesize of output 15 [2023-11-06 22:24:38,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 24 [2023-11-06 22:24:38,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:38,770 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 35 treesize of output 26 [2023-11-06 22:24:38,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:24:38,853 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 35 treesize of output 26 [2023-11-06 22:24:38,946 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:24:38,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 27 [2023-11-06 22:24:39,014 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:24:39,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 12 [2023-11-06 22:24:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 100 proven. 213 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-11-06 22:24:39,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:24:39,117 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_~#double_Array_0~0.base| v_ArrVal_903) |c_~#BOOL_unsigned_char_Array_0~0.base|) (+ 3 |c_~#BOOL_unsigned_char_Array_0~0.offset|)))) (< .cse0 (+ (* 256 (div .cse0 256)) 1)))) is different from false [2023-11-06 22:24:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677160335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:24:39,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:24:39,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-06 22:24:39,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052783644] [2023-11-06 22:24:39,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:24:39,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 22:24:39,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 22:24:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=453, Unknown=13, NotChecked=44, Total=600 [2023-11-06 22:24:39,390 INFO L87 Difference]: Start difference. First operand 279 states and 341 transitions. Second operand has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-06 22:24:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:41,410 INFO L93 Difference]: Finished difference Result 551 states and 670 transitions. [2023-11-06 22:24:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-06 22:24:41,410 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2023-11-06 22:24:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:41,413 INFO L225 Difference]: With dead ends: 551 [2023-11-06 22:24:41,413 INFO L226 Difference]: Without dead ends: 288 [2023-11-06 22:24:41,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=412, Invalid=1385, Unknown=13, NotChecked=82, Total=1892 [2023-11-06 22:24:41,415 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 512 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:41,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 456 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 22:24:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-11-06 22:24:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 275. [2023-11-06 22:24:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 229 states have (on average 1.1528384279475983) internal successors, (264), 231 states have internal predecessors, (264), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-06 22:24:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 334 transitions. [2023-11-06 22:24:41,468 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 334 transitions. Word has length 132 [2023-11-06 22:24:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:41,469 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 334 transitions. [2023-11-06 22:24:41,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.421052631578948) internal successors, (122), 21 states have internal predecessors, (122), 9 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (30), 7 states have call predecessors, (30), 9 states have call successors, (30) [2023-11-06 22:24:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 334 transitions. [2023-11-06 22:24:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-06 22:24:41,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:41,471 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:41,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:41,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:24:41,678 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:41,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -970248319, now seen corresponding path program 1 times [2023-11-06 22:24:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:41,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714294610] [2023-11-06 22:24:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714294610] [2023-11-06 22:24:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714294610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:42,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:42,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825257094] [2023-11-06 22:24:42,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:42,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:42,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:42,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:42,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:42,009 INFO L87 Difference]: Start difference. First operand 275 states and 334 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:42,214 INFO L93 Difference]: Finished difference Result 486 states and 584 transitions. [2023-11-06 22:24:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:24:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2023-11-06 22:24:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:42,217 INFO L225 Difference]: With dead ends: 486 [2023-11-06 22:24:42,217 INFO L226 Difference]: Without dead ends: 266 [2023-11-06 22:24:42,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:42,219 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 47 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:42,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 346 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:24:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-06 22:24:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2023-11-06 22:24:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.1187214611872147) internal successors, (245), 221 states have internal predecessors, (245), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-06 22:24:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 315 transitions. [2023-11-06 22:24:42,274 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 315 transitions. Word has length 133 [2023-11-06 22:24:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:42,275 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 315 transitions. [2023-11-06 22:24:42,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 315 transitions. [2023-11-06 22:24:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:24:42,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:42,279 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:42,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:24:42,280 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:42,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1644886059, now seen corresponding path program 1 times [2023-11-06 22:24:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323666487] [2023-11-06 22:24:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:42,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323666487] [2023-11-06 22:24:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323666487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:42,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321441598] [2023-11-06 22:24:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:42,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:42,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:42,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:42,540 INFO L87 Difference]: Start difference. First operand 265 states and 315 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:42,762 INFO L93 Difference]: Finished difference Result 432 states and 513 transitions. [2023-11-06 22:24:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:42,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2023-11-06 22:24:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:42,764 INFO L225 Difference]: With dead ends: 432 [2023-11-06 22:24:42,765 INFO L226 Difference]: Without dead ends: 222 [2023-11-06 22:24:42,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:42,766 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:42,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 360 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:42,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-11-06 22:24:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2023-11-06 22:24:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 176 states have (on average 1.1079545454545454) internal successors, (195), 178 states have internal predecessors, (195), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-06 22:24:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 265 transitions. [2023-11-06 22:24:42,837 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 265 transitions. Word has length 134 [2023-11-06 22:24:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:42,838 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 265 transitions. [2023-11-06 22:24:42,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 265 transitions. [2023-11-06 22:24:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-06 22:24:42,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:24:42,840 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:42,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:24:42,840 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:24:42,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1901447071, now seen corresponding path program 1 times [2023-11-06 22:24:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:24:42,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780012209] [2023-11-06 22:24:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:24:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:24:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:24:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:24:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:24:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:24:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:24:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:24:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:24:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:24:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:24:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:24:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:24:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:24:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:24:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:24:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 22:24:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:24:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-06 22:24:43,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:24:43,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780012209] [2023-11-06 22:24:43,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780012209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:43,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:43,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952853895] [2023-11-06 22:24:43,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:43,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:24:43,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:24:43,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:24:43,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:24:43,195 INFO L87 Difference]: Start difference. First operand 222 states and 265 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:43,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:24:43,401 INFO L93 Difference]: Finished difference Result 337 states and 402 transitions. [2023-11-06 22:24:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:24:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2023-11-06 22:24:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:24:43,403 INFO L225 Difference]: With dead ends: 337 [2023-11-06 22:24:43,403 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:24:43,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:43,406 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 19 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:24:43,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 317 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:24:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:24:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:24:43,407 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:24:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:24:43,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2023-11-06 22:24:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:24:43,408 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:24:43,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-11-06 22:24:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:24:43,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:24:43,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:24:43,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:24:43,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:24:46,293 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod .cse0 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (= (select .cse1 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)) .cse0) (<= 8 |~#unsigned_char_Array_0~0.base|)))) [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 47 57) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L103-2(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,294 INFO L899 garLoopResultBuilder]: For program point L103-3(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-4(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-5(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-6(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-8(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-10(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-12(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-14(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,295 INFO L899 garLoopResultBuilder]: For program point L103-15(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,296 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,296 INFO L899 garLoopResultBuilder]: For program point L103-16(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,297 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-06 22:24:46,297 INFO L899 garLoopResultBuilder]: For program point L103-17(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,297 INFO L899 garLoopResultBuilder]: For program point L103-19(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,297 INFO L899 garLoopResultBuilder]: For program point L103-21(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,297 INFO L899 garLoopResultBuilder]: For program point L103-23(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-25(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-26(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-27(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-29(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-30(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,298 INFO L899 garLoopResultBuilder]: For program point L103-31(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-32(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-34(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-35(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-37(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-39(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,299 INFO L899 garLoopResultBuilder]: For program point L103-41(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,300 INFO L899 garLoopResultBuilder]: For program point L103-43(line 103) no Hoare annotation was computed. [2023-11-06 22:24:46,300 INFO L895 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,300 INFO L899 garLoopResultBuilder]: For program point L88-1(line 88) no Hoare annotation was computed. [2023-11-06 22:24:46,301 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 73) no Hoare annotation was computed. [2023-11-06 22:24:46,302 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,302 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-06 22:24:46,302 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 102 105) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse1 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= 1 |ULTIMATE.start_property_#res#1|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod .cse0 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (= (select .cse1 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 2)) (select .cse1 |~#BOOL_unsigned_char_Array_0~0.offset|)) (= (select .cse1 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)) .cse0) (<= 8 |~#unsigned_char_Array_0~0.base|)))) [2023-11-06 22:24:46,302 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 98) no Hoare annotation was computed. [2023-11-06 22:24:46,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:24:46,303 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,303 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-11-06 22:24:46,303 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2023-11-06 22:24:46,303 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2023-11-06 22:24:46,303 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-11-06 22:24:46,303 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2023-11-06 22:24:46,304 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (<= (mod .cse8 256) 0)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse1 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse7 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (<= .cse1 (+ (* (div (+ (- 1) .cse1) 256) 256) 255)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse1 .cse8) .cse7))))) [2023-11-06 22:24:46,305 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-11-06 22:24:46,305 INFO L895 garLoopResultBuilder]: At program point L109-2(lines 109 115) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse7 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse6 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse1 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse2 (<= 5 |~#double_Array_0~0.base|)) (.cse3 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse4 (<= (mod .cse7 256) 0)) (.cse5 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse8 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 .cse7) .cse8) (and .cse0 (<= .cse6 (+ (* (div (+ (- 1) .cse6) 256) 256) 255)) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 2)) (select .cse9 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse8))))) [2023-11-06 22:24:46,305 INFO L899 garLoopResultBuilder]: For program point L109-3(lines 109 115) no Hoare annotation was computed. [2023-11-06 22:24:46,305 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,306 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-11-06 22:24:46,306 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 62) no Hoare annotation was computed. [2023-11-06 22:24:46,306 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse8 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (<= (mod .cse8 256) 0)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse1 (select .cse9 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3))) (.cse7 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (<= .cse1 (+ (* (div (+ (- 1) .cse1) 256) 256) 255)) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= .cse1 .cse8) .cse7))))) [2023-11-06 22:24:46,306 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-11-06 22:24:46,307 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 106 117) the Hoare annotation is: false [2023-11-06 22:24:46,307 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,307 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2023-11-06 22:24:46,309 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-06 22:24:46,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:24:46,309 INFO L899 garLoopResultBuilder]: For program point L61-2(line 61) no Hoare annotation was computed. [2023-11-06 22:24:46,309 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse2 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse3 (<= 5 |~#double_Array_0~0.base|)) (.cse4 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse5 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse6 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (let ((.cse1 (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)))) (<= .cse1 (* 256 (div .cse1 256)))) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse6))) [2023-11-06 22:24:46,310 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-11-06 22:24:46,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:24:46,310 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,310 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-11-06 22:24:46,310 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (<= 6 |~#signed_char_Array_0~0.base|)) (.cse3 (<= 7 |~#signed_long_int_Array_0~0.base|)) (.cse4 (<= 5 |~#double_Array_0~0.base|)) (.cse5 (<= |~#BOOL_unsigned_char_Array_0~0.base| 4)) (.cse6 (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|))) (.cse7 (= |ULTIMATE.start_updateVariables_#t~mem37#1| (select .cse2 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)))) (.cse8 (<= 8 |~#unsigned_char_Array_0~0.base|))) (or (and .cse0 (let ((.cse1 (select .cse2 (+ |~#BOOL_unsigned_char_Array_0~0.offset| 3)))) (<= .cse1 (* 256 (div .cse1 256)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_int| |~#signed_long_int_Array_0~0.base|) |~#signed_long_int_Array_0~0.offset|) (select (select |#memory_int| |~#signed_char_Array_0~0.base|) (+ |~#signed_char_Array_0~0.offset| 1)))) .cse7 .cse8)))) [2023-11-06 22:24:46,311 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-11-06 22:24:46,311 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 57) no Hoare annotation was computed. [2023-11-06 22:24:46,311 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,311 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-06 22:24:46,311 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 72) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point L48-2(line 48) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 69) no Hoare annotation was computed. [2023-11-06 22:24:46,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L899 garLoopResultBuilder]: For program point L82-2(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L899 garLoopResultBuilder]: For program point L82-3(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L899 garLoopResultBuilder]: For program point L82-5(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L899 garLoopResultBuilder]: For program point L82-7(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,313 INFO L895 garLoopResultBuilder]: At program point L82-8(line 82) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,314 INFO L899 garLoopResultBuilder]: For program point L82-9(line 82) no Hoare annotation was computed. [2023-11-06 22:24:46,314 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 101) no Hoare annotation was computed. [2023-11-06 22:24:46,314 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-06 22:24:46,314 INFO L899 garLoopResultBuilder]: For program point L66-2(line 66) no Hoare annotation was computed. [2023-11-06 22:24:46,314 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 56) no Hoare annotation was computed. [2023-11-06 22:24:46,314 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (and (<= 6 |~#signed_char_Array_0~0.base|) (<= 7 |~#signed_long_int_Array_0~0.base|) (<= 5 |~#double_Array_0~0.base|) (<= |~#BOOL_unsigned_char_Array_0~0.base| 4) (<= (mod (select (select |#memory_int| |~#BOOL_unsigned_char_Array_0~0.base|) (+ |~#BOOL_unsigned_char_Array_0~0.offset| 1)) 256) 0) (not (= |~#signed_long_int_Array_0~0.base| |~#signed_char_Array_0~0.base|)) (<= 8 |~#unsigned_char_Array_0~0.base|)) [2023-11-06 22:24:46,315 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-11-06 22:24:46,315 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:24:46,315 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:24:46,315 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:24:46,315 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:24:46,320 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:46,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:46,343 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,344 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,345 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,345 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,345 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,346 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,346 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,346 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,349 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,349 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,349 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,350 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,350 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,350 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,350 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,350 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,361 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,361 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,362 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,362 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,362 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,362 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,363 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,363 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,363 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,363 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,364 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,364 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,365 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,365 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,365 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,365 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,367 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,368 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,369 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,369 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,370 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,370 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,378 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,379 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,379 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,380 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,380 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,380 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,380 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,383 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,383 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,384 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,384 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,384 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,384 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,389 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,389 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,389 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,390 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,391 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,391 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:46 BoogieIcfgContainer [2023-11-06 22:24:46,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:46,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:46,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:46,393 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:46,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:17" (3/4) ... [2023-11-06 22:24:46,396 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:24:46,401 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:24:46,422 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:24:46,423 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:24:46,424 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:24:46,425 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:24:46,472 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (1 <= \result)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0)) [2023-11-06 22:24:46,559 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (1 <= \result)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0)) [2023-11-06 22:24:46,580 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:24:46,580 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:24:46,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:46,586 INFO L158 Benchmark]: Toolchain (without parser) took 30404.11ms. Allocated memory was 178.3MB in the beginning and 453.0MB in the end (delta: 274.7MB). Free memory was 108.5MB in the beginning and 264.6MB in the end (delta: -156.0MB). Peak memory consumption was 121.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,586 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 178.3MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:46,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.97ms. Allocated memory is still 178.3MB. Free memory was 108.3MB in the beginning and 143.6MB in the end (delta: -35.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.90ms. Allocated memory is still 178.3MB. Free memory was 143.6MB in the beginning and 140.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,591 INFO L158 Benchmark]: Boogie Preprocessor took 56.91ms. Allocated memory is still 178.3MB. Free memory was 140.4MB in the beginning and 137.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,592 INFO L158 Benchmark]: RCFGBuilder took 886.90ms. Allocated memory is still 178.3MB. Free memory was 137.5MB in the beginning and 128.2MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,592 INFO L158 Benchmark]: TraceAbstraction took 28784.55ms. Allocated memory was 178.3MB in the beginning and 453.0MB in the end (delta: 274.7MB). Free memory was 127.4MB in the beginning and 273.0MB in the end (delta: -145.5MB). Peak memory consumption was 216.4MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,593 INFO L158 Benchmark]: Witness Printer took 188.46ms. Allocated memory is still 453.0MB. Free memory was 273.0MB in the beginning and 264.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:24:46,599 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 178.3MB. Free memory is still 150.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.97ms. Allocated memory is still 178.3MB. Free memory was 108.3MB in the beginning and 143.6MB in the end (delta: -35.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.90ms. Allocated memory is still 178.3MB. Free memory was 143.6MB in the beginning and 140.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.91ms. Allocated memory is still 178.3MB. Free memory was 140.4MB in the beginning and 137.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 886.90ms. Allocated memory is still 178.3MB. Free memory was 137.5MB in the beginning and 128.2MB in the end (delta: 9.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28784.55ms. Allocated memory was 178.3MB in the beginning and 453.0MB in the end (delta: 274.7MB). Free memory was 127.4MB in the beginning and 273.0MB in the end (delta: -145.5MB). Peak memory consumption was 216.4MB. Max. memory is 16.1GB. * Witness Printer took 188.46ms. Allocated memory is still 453.0MB. Free memory was 273.0MB in the beginning and 264.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 22, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3032 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3009 mSDsluCounter, 9129 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6433 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5386 IncrementalHoareTripleChecker+Invalid, 5698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 2696 mSDtfsCounter, 5386 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1070 GetRequests, 897 SyntacticMatches, 3 SemanticMatches, 170 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=18, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 451 PreInvPairs, 485 NumberOfFragments, 975 HoareAnnotationTreeSize, 451 FomulaSimplifications, 48581 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 11448 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 2919 NumberOfCodeBlocks, 2919 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2896 ConstructedInterpolants, 0 QuantifiedInterpolants, 13426 SizeOfPredicates, 12 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 9414/9660 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: 106]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 102]: Loop Invariant [2023-11-06 22:24:46,623 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,624 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,624 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,624 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,630 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,631 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,632 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated Derived loop invariant: (((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (1 <= \result)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0)) - InvariantResult [Line: 109]: Loop Invariant [2023-11-06 22:24:46,633 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,634 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,635 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,635 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,635 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,636 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,637 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,643 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,644 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,645 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,646 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,647 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,647 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,647 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,647 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 2] could not be translated [2023-11-06 22:24:46,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,648 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#signed_char_Array_0~0!base][~#signed_char_Array_0~0!offset + 1] could not be translated Derived loop invariant: (((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0)) || ((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0))) - InvariantResult [Line: 19]: Loop Invariant [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,649 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,651 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated [2023-11-06 22:24:46,652 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,652 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 3] could not be translated [2023-11-06 22:24:46,652 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base] could not be translated [2023-11-06 22:24:46,652 WARN L1553 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset + 1] could not be translated Derived loop invariant: ((((((6 <= signed_char_Array_0) && (7 <= signed_long_int_Array_0)) && (5 <= double_Array_0)) && (BOOL_unsigned_char_Array_0 <= 4)) && !((signed_long_int_Array_0 == signed_char_Array_0))) && (8 <= unsigned_char_Array_0)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:24:46,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a297d38-55b7-4525-8783-a88f1fed5cb0/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