./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:29:37,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:29:37,214 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 00:29:37,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:29:37,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:29:37,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:29:37,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:29:37,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:29:37,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:29:37,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:29:37,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:29:37,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:29:37,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:29:37,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:29:37,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:29:37,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:29:37,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:29:37,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:29:37,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:29:37,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:29:37,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:29:37,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:29:37,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:29:37,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:29:37,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:29:37,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:29:37,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:29:37,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:29:37,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:29:37,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:29:37,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a [2024-11-24 00:29:37,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:29:37,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:29:37,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:29:37,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:29:37,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:29:37,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-11-24 00:29:40,653 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/cd68d404d/f77d3a2599744a36b5e4e297b098ba00/FLAG310bf8cc7 [2024-11-24 00:29:40,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:29:40,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-11-24 00:29:40,937 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/cd68d404d/f77d3a2599744a36b5e4e297b098ba00/FLAG310bf8cc7 [2024-11-24 00:29:40,951 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/cd68d404d/f77d3a2599744a36b5e4e297b098ba00 [2024-11-24 00:29:40,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:29:40,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:29:40,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:29:40,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:29:40,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:29:40,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:29:40" (1/1) ... [2024-11-24 00:29:40,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5881efad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:40, skipping insertion in model container [2024-11-24 00:29:40,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:29:40" (1/1) ... [2024-11-24 00:29:40,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:29:41,178 WARN L250 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_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2024-11-24 00:29:41,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:29:41,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:29:41,272 WARN L250 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_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2024-11-24 00:29:41,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:29:41,329 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:29:41,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41 WrapperNode [2024-11-24 00:29:41,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:29:41,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:29:41,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:29:41,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:29:41,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,409 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2024-11-24 00:29:41,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:29:41,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:29:41,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:29:41,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:29:41,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,460 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 00:29:41,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:29:41,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:29:41,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:29:41,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:29:41,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (1/1) ... [2024-11-24 00:29:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:29:41,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:29:41,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:29:41,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:29:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:29:41,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 00:29:41,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 00:29:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 00:29:41,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:29:41,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:29:41,694 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:29:41,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:29:42,235 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-24 00:29:42,236 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:29:42,253 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:29:42,256 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 00:29:42,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:29:42 BoogieIcfgContainer [2024-11-24 00:29:42,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:29:42,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:29:42,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:29:42,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:29:42,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:29:40" (1/3) ... [2024-11-24 00:29:42,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722bb991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:29:42, skipping insertion in model container [2024-11-24 00:29:42,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:29:41" (2/3) ... [2024-11-24 00:29:42,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722bb991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:29:42, skipping insertion in model container [2024-11-24 00:29:42,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:29:42" (3/3) ... [2024-11-24 00:29:42,271 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-10.i [2024-11-24 00:29:42,293 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:29:42,295 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-10.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:29:42,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:29:42,387 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5686e369, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:29:42,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:29:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-24 00:29:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 00:29:42,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:29:42,406 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:29:42,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:29:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:29:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash -674447237, now seen corresponding path program 1 times [2024-11-24 00:29:42,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:29:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997017237] [2024-11-24 00:29:42,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:29:42,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:29:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:29:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-24 00:29:42,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:29:42,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997017237] [2024-11-24 00:29:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997017237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 00:29:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449682281] [2024-11-24 00:29:42,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:29:42,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:29:42,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:29:42,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:29:42,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:29:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:29:42,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 00:29:42,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:29:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-24 00:29:43,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:29:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449682281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:29:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:29:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 00:29:43,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844570034] [2024-11-24 00:29:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:29:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:29:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:29:43,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:29:43,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:29:43,057 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:29:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:29:43,097 INFO L93 Difference]: Finished difference Result 135 states and 226 transitions. [2024-11-24 00:29:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:29:43,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-24 00:29:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:29:43,106 INFO L225 Difference]: With dead ends: 135 [2024-11-24 00:29:43,106 INFO L226 Difference]: Without dead ends: 67 [2024-11-24 00:29:43,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:29:43,114 INFO L435 NwaCegarLoop]: 100 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, 100 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 [2024-11-24 00:29:43,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:29:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-24 00:29:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-24 00:29:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-24 00:29:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2024-11-24 00:29:43,155 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 119 [2024-11-24 00:29:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:29:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2024-11-24 00:29:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:29:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2024-11-24 00:29:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-24 00:29:43,160 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:29:43,160 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:29:43,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:29:43,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-24 00:29:43,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:29:43,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:29:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1079393861, now seen corresponding path program 1 times [2024-11-24 00:29:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:29:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591029646] [2024-11-24 00:29:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:29:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:29:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:29:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:29:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:29:44,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591029646] [2024-11-24 00:29:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591029646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:29:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:29:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:29:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107765698] [2024-11-24 00:29:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:29:44,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:29:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:29:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:29:44,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:29:44,130 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:29:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:29:44,343 INFO L93 Difference]: Finished difference Result 196 states and 295 transitions. [2024-11-24 00:29:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:29:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-24 00:29:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:29:44,346 INFO L225 Difference]: With dead ends: 196 [2024-11-24 00:29:44,346 INFO L226 Difference]: Without dead ends: 132 [2024-11-24 00:29:44,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:29:44,348 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 68 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:29:44,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 279 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:29:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-24 00:29:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 101. [2024-11-24 00:29:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:29:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2024-11-24 00:29:44,395 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 119 [2024-11-24 00:29:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:29:44,398 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2024-11-24 00:29:44,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:29:44,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2024-11-24 00:29:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:29:44,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:29:44,404 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:29:44,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:29:44,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:29:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:29:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1692576384, now seen corresponding path program 1 times [2024-11-24 00:29:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:29:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351477337] [2024-11-24 00:29:44,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:29:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:29:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:30:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:30:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:30:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351477337] [2024-11-24 00:30:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351477337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:30:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:30:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 00:30:05,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298688131] [2024-11-24 00:30:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:30:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:30:05,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:30:05,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:30:05,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:30:05,057 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:30:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:30:07,078 INFO L93 Difference]: Finished difference Result 323 states and 469 transitions. [2024-11-24 00:30:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:30:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-24 00:30:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:30:07,081 INFO L225 Difference]: With dead ends: 323 [2024-11-24 00:30:07,082 INFO L226 Difference]: Without dead ends: 259 [2024-11-24 00:30:07,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:30:07,083 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 610 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:30:07,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 325 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 00:30:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-24 00:30:07,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 128. [2024-11-24 00:30:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:30:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2024-11-24 00:30:07,108 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 120 [2024-11-24 00:30:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:30:07,109 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2024-11-24 00:30:07,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:30:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2024-11-24 00:30:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:30:07,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:30:07,112 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:30:07,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:30:07,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:30:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:30:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1793044286, now seen corresponding path program 1 times [2024-11-24 00:30:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:30:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547443083] [2024-11-24 00:30:07,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:30:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:30:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:31:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:31:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:31:31,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547443083] [2024-11-24 00:31:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547443083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:31:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:31:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 00:31:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236204073] [2024-11-24 00:31:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:31:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:31:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:31:31,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:31:31,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:31:31,946 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:31:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:31:40,933 INFO L93 Difference]: Finished difference Result 377 states and 554 transitions. [2024-11-24 00:31:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 00:31:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-24 00:31:40,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:31:40,936 INFO L225 Difference]: With dead ends: 377 [2024-11-24 00:31:40,936 INFO L226 Difference]: Without dead ends: 286 [2024-11-24 00:31:40,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:31:40,939 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 915 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:31:40,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 272 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-24 00:31:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-24 00:31:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 139. [2024-11-24 00:31:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:31:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-24 00:31:40,986 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 120 [2024-11-24 00:31:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:31:40,987 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-24 00:31:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:31:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-24 00:31:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:31:40,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:31:40,989 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:31:40,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:31:40,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:31:40,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:31:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1175423360, now seen corresponding path program 1 times [2024-11-24 00:31:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:31:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326813478] [2024-11-24 00:31:40,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:31:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:31:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:32:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:32:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:32:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326813478] [2024-11-24 00:32:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326813478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:32:36,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:32:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:32:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154951539] [2024-11-24 00:32:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:32:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:32:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:32:36,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:32:36,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:32:36,659 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:32:38,348 INFO L93 Difference]: Finished difference Result 353 states and 520 transitions. [2024-11-24 00:32:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:32:38,348 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-24 00:32:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:32:38,351 INFO L225 Difference]: With dead ends: 353 [2024-11-24 00:32:38,351 INFO L226 Difference]: Without dead ends: 251 [2024-11-24 00:32:38,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:32:38,352 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 313 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-24 00:32:38,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 438 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-24 00:32:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-24 00:32:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 139. [2024-11-24 00:32:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:32:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 212 transitions. [2024-11-24 00:32:38,372 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 212 transitions. Word has length 120 [2024-11-24 00:32:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:32:38,373 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 212 transitions. [2024-11-24 00:32:38,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 212 transitions. [2024-11-24 00:32:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:32:38,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:32:38,375 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:32:38,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:32:38,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:32:38,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:32:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2015584898, now seen corresponding path program 1 times [2024-11-24 00:32:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:32:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275832373] [2024-11-24 00:32:38,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:32:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:32:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:32:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:32:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:32:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275832373] [2024-11-24 00:32:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275832373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:32:38,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:32:38,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 00:32:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129718847] [2024-11-24 00:32:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:32:38,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:32:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:32:38,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:32:38,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:32:38,703 INFO L87 Difference]: Start difference. First operand 139 states and 212 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:32:38,914 INFO L93 Difference]: Finished difference Result 264 states and 400 transitions. [2024-11-24 00:32:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 00:32:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-24 00:32:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:32:38,917 INFO L225 Difference]: With dead ends: 264 [2024-11-24 00:32:38,917 INFO L226 Difference]: Without dead ends: 162 [2024-11-24 00:32:38,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:32:38,918 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 84 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:32:38,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 155 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:32:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-24 00:32:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 139. [2024-11-24 00:32:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:32:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 210 transitions. [2024-11-24 00:32:38,948 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 210 transitions. Word has length 120 [2024-11-24 00:32:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:32:38,951 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 210 transitions. [2024-11-24 00:32:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 210 transitions. [2024-11-24 00:32:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:32:38,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:32:38,953 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:32:38,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:32:38,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:32:38,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:32:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1206238272, now seen corresponding path program 1 times [2024-11-24 00:32:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:32:38,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314987202] [2024-11-24 00:32:38,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:32:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:32:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:32:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:32:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:32:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314987202] [2024-11-24 00:32:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314987202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:32:57,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:32:57,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:32:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031015255] [2024-11-24 00:32:57,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:32:57,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:32:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:32:57,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:32:57,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:32:57,121 INFO L87 Difference]: Start difference. First operand 139 states and 210 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:32:57,897 INFO L93 Difference]: Finished difference Result 373 states and 547 transitions. [2024-11-24 00:32:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:32:57,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-24 00:32:57,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:32:57,899 INFO L225 Difference]: With dead ends: 373 [2024-11-24 00:32:57,899 INFO L226 Difference]: Without dead ends: 271 [2024-11-24 00:32:57,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:32:57,900 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 238 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:32:57,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 501 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 00:32:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-24 00:32:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 191. [2024-11-24 00:32:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 133 states have internal predecessors, (174), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-24 00:32:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2024-11-24 00:32:57,928 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 120 [2024-11-24 00:32:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:32:57,929 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2024-11-24 00:32:57,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:32:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2024-11-24 00:32:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:32:57,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:32:57,931 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:32:57,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:32:57,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:32:57,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:32:57,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1322527234, now seen corresponding path program 1 times [2024-11-24 00:32:57,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:32:57,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952243676] [2024-11-24 00:32:57,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:32:57,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:32:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:33:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:33:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:33:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952243676] [2024-11-24 00:33:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952243676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:33:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:33:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 00:33:23,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398684368] [2024-11-24 00:33:23,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:33:23,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:33:23,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:33:23,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:33:23,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:33:23,526 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:33:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:33:28,142 INFO L93 Difference]: Finished difference Result 455 states and 651 transitions. [2024-11-24 00:33:28,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:33:28,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-24 00:33:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:33:28,147 INFO L225 Difference]: With dead ends: 455 [2024-11-24 00:33:28,147 INFO L226 Difference]: Without dead ends: 299 [2024-11-24 00:33:28,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2024-11-24 00:33:28,148 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 425 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-24 00:33:28,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 393 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-24 00:33:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-24 00:33:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 191. [2024-11-24 00:33:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 132 states have (on average 1.3181818181818181) internal successors, (174), 133 states have internal predecessors, (174), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-24 00:33:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2024-11-24 00:33:28,175 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 120 [2024-11-24 00:33:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:33:28,175 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2024-11-24 00:33:28,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:33:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2024-11-24 00:33:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:33:28,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:33:28,177 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:33:28,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:33:28,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:33:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:33:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1839680258, now seen corresponding path program 1 times [2024-11-24 00:33:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:33:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499833458] [2024-11-24 00:33:28,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:33:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:33:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:34:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:34:28,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:34:28,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499833458] [2024-11-24 00:34:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499833458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:34:28,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:34:28,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:34:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219746798] [2024-11-24 00:34:28,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:34:28,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:34:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:34:28,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:34:28,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:34:28,546 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:34:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:34:32,580 INFO L93 Difference]: Finished difference Result 439 states and 632 transitions. [2024-11-24 00:34:32,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 00:34:32,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-24 00:34:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:34:32,583 INFO L225 Difference]: With dead ends: 439 [2024-11-24 00:34:32,583 INFO L226 Difference]: Without dead ends: 283 [2024-11-24 00:34:32,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-24 00:34:32,585 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 342 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:34:32,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 354 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 00:34:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-24 00:34:32,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 204. [2024-11-24 00:34:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 148 states have internal predecessors, (195), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:34:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 295 transitions. [2024-11-24 00:34:32,617 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 295 transitions. Word has length 120 [2024-11-24 00:34:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:34:32,618 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 295 transitions. [2024-11-24 00:34:32,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:34:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 295 transitions. [2024-11-24 00:34:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-24 00:34:32,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:34:32,620 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:34:32,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:34:32,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:34:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:34:32,621 INFO L85 PathProgramCache]: Analyzing trace with hash -73625406, now seen corresponding path program 1 times [2024-11-24 00:34:32,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:34:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950597200] [2024-11-24 00:34:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:34:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:34:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:34:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:34:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:34:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950597200] [2024-11-24 00:34:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950597200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:34:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:34:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-24 00:34:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147631963] [2024-11-24 00:34:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:34:53,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 00:34:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:34:53,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 00:34:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-24 00:34:53,890 INFO L87 Difference]: Start difference. First operand 204 states and 295 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:34:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:34:55,269 INFO L93 Difference]: Finished difference Result 434 states and 618 transitions. [2024-11-24 00:34:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 00:34:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-24 00:34:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:34:55,272 INFO L225 Difference]: With dead ends: 434 [2024-11-24 00:34:55,272 INFO L226 Difference]: Without dead ends: 259 [2024-11-24 00:34:55,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:34:55,273 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 187 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:34:55,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 402 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 00:34:55,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-24 00:34:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 204. [2024-11-24 00:34:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 148 states have internal predecessors, (194), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:34:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 294 transitions. [2024-11-24 00:34:55,301 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 294 transitions. Word has length 120 [2024-11-24 00:34:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:34:55,301 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 294 transitions. [2024-11-24 00:34:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:34:55,302 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 294 transitions. [2024-11-24 00:34:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:34:55,303 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:34:55,303 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:34:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:34:55,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:34:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:34:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -385328811, now seen corresponding path program 1 times [2024-11-24 00:34:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:34:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400551987] [2024-11-24 00:34:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:34:55,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:34:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:35:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:35:10,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:35:10,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400551987] [2024-11-24 00:35:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400551987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:35:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:35:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:35:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155339022] [2024-11-24 00:35:10,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:35:10,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:35:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:35:10,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:35:10,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:35:10,466 INFO L87 Difference]: Start difference. First operand 204 states and 294 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:35:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:35:12,242 INFO L93 Difference]: Finished difference Result 468 states and 660 transitions. [2024-11-24 00:35:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:35:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-24 00:35:12,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:35:12,245 INFO L225 Difference]: With dead ends: 468 [2024-11-24 00:35:12,245 INFO L226 Difference]: Without dead ends: 293 [2024-11-24 00:35:12,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=87, Invalid=123, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:35:12,246 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 327 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:35:12,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 470 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 00:35:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-24 00:35:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 206. [2024-11-24 00:35:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 149 states have (on average 1.3221476510067114) internal successors, (197), 150 states have internal predecessors, (197), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:35:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2024-11-24 00:35:12,272 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 121 [2024-11-24 00:35:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:35:12,272 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2024-11-24 00:35:12,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:35:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2024-11-24 00:35:12,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:35:12,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:35:12,274 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:35:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:35:12,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:35:12,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:35:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash 294729559, now seen corresponding path program 1 times [2024-11-24 00:35:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:35:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532435136] [2024-11-24 00:35:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:35:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:35:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:36:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:36:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:36:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532435136] [2024-11-24 00:36:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532435136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:36:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:36:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 00:36:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413715798] [2024-11-24 00:36:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:36:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:36:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:36:29,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:36:29,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:36:29,553 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:36:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:36:41,822 INFO L93 Difference]: Finished difference Result 557 states and 777 transitions. [2024-11-24 00:36:41,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-24 00:36:41,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2024-11-24 00:36:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:36:41,825 INFO L225 Difference]: With dead ends: 557 [2024-11-24 00:36:41,825 INFO L226 Difference]: Without dead ends: 380 [2024-11-24 00:36:41,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=293, Invalid=577, Unknown=0, NotChecked=0, Total=870 [2024-11-24 00:36:41,827 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 738 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:36:41,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 301 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-24 00:36:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-24 00:36:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 208. [2024-11-24 00:36:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 152 states have internal predecessors, (201), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:36:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 301 transitions. [2024-11-24 00:36:41,859 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 301 transitions. Word has length 121 [2024-11-24 00:36:41,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:36:41,859 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 301 transitions. [2024-11-24 00:36:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:36:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 301 transitions. [2024-11-24 00:36:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:36:41,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:36:41,861 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:36:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:36:41,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:36:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:36:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1533454251, now seen corresponding path program 1 times [2024-11-24 00:36:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:36:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270477610] [2024-11-24 00:36:41,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:36:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:36:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:37:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:37:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:37:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270477610] [2024-11-24 00:37:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270477610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:37:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:37:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 00:37:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423006584] [2024-11-24 00:37:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:37:13,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:37:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:37:13,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:37:13,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:37:13,364 INFO L87 Difference]: Start difference. First operand 208 states and 301 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:37:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:37:17,537 INFO L93 Difference]: Finished difference Result 531 states and 745 transitions. [2024-11-24 00:37:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-24 00:37:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2024-11-24 00:37:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:37:17,540 INFO L225 Difference]: With dead ends: 531 [2024-11-24 00:37:17,541 INFO L226 Difference]: Without dead ends: 352 [2024-11-24 00:37:17,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2024-11-24 00:37:17,542 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 744 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:37:17,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 329 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-24 00:37:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-24 00:37:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 208. [2024-11-24 00:37:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 152 states have internal predecessors, (202), 50 states have call successors, (50), 6 states have call predecessors, (50), 6 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-24 00:37:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 302 transitions. [2024-11-24 00:37:17,573 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 302 transitions. Word has length 121 [2024-11-24 00:37:17,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:37:17,574 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 302 transitions. [2024-11-24 00:37:17,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:37:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 302 transitions. [2024-11-24 00:37:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:37:17,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:37:17,575 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:37:17,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:37:17,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:37:17,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:37:17,576 INFO L85 PathProgramCache]: Analyzing trace with hash -716387691, now seen corresponding path program 1 times [2024-11-24 00:37:17,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:37:17,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112669918] [2024-11-24 00:37:17,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:37:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:37:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:37:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:37:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:37:37,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112669918] [2024-11-24 00:37:37,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112669918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:37:37,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:37:37,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:37:37,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974424669] [2024-11-24 00:37:37,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:37:37,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:37:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:37:37,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:37:37,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:37:37,020 INFO L87 Difference]: Start difference. First operand 208 states and 302 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:37:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:37:41,886 INFO L93 Difference]: Finished difference Result 558 states and 788 transitions. [2024-11-24 00:37:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-24 00:37:41,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-24 00:37:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:37:41,889 INFO L225 Difference]: With dead ends: 558 [2024-11-24 00:37:41,889 INFO L226 Difference]: Without dead ends: 379 [2024-11-24 00:37:41,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-11-24 00:37:41,891 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 364 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:37:41,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 502 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 00:37:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-24 00:37:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 252. [2024-11-24 00:37:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 192 states have (on average 1.3385416666666667) internal successors, (257), 194 states have internal predecessors, (257), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:37:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 361 transitions. [2024-11-24 00:37:41,931 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 361 transitions. Word has length 121 [2024-11-24 00:37:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:37:41,931 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 361 transitions. [2024-11-24 00:37:41,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:37:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 361 transitions. [2024-11-24 00:37:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-24 00:37:41,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:37:41,932 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:37:41,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:37:41,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:37:41,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:37:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash -779515243, now seen corresponding path program 1 times [2024-11-24 00:37:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:37:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238626846] [2024-11-24 00:37:41,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:37:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:37:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:37:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:37:42,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:37:42,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238626846] [2024-11-24 00:37:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238626846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:37:42,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:37:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 00:37:42,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682374504] [2024-11-24 00:37:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:37:42,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 00:37:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:37:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 00:37:42,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-24 00:37:42,769 INFO L87 Difference]: Start difference. First operand 252 states and 361 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:37:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:37:43,307 INFO L93 Difference]: Finished difference Result 602 states and 861 transitions. [2024-11-24 00:37:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 00:37:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-24 00:37:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:37:43,310 INFO L225 Difference]: With dead ends: 602 [2024-11-24 00:37:43,310 INFO L226 Difference]: Without dead ends: 353 [2024-11-24 00:37:43,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:37:43,312 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 280 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:37:43,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 267 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 00:37:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-24 00:37:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 268. [2024-11-24 00:37:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 208 states have (on average 1.3653846153846154) internal successors, (284), 210 states have internal predecessors, (284), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:37:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 388 transitions. [2024-11-24 00:37:43,351 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 388 transitions. Word has length 121 [2024-11-24 00:37:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:37:43,352 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 388 transitions. [2024-11-24 00:37:43,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:37:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 388 transitions. [2024-11-24 00:37:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-24 00:37:43,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:37:43,354 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:37:43,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:37:43,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:37:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:37:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1234476054, now seen corresponding path program 1 times [2024-11-24 00:37:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:37:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588296774] [2024-11-24 00:37:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:37:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:37:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:13,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588296774] [2024-11-24 00:38:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588296774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:13,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:13,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 00:38:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337509562] [2024-11-24 00:38:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:13,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 00:38:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:13,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 00:38:13,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-24 00:38:13,585 INFO L87 Difference]: Start difference. First operand 268 states and 388 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:17,249 INFO L93 Difference]: Finished difference Result 613 states and 871 transitions. [2024-11-24 00:38:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-24 00:38:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:17,252 INFO L225 Difference]: With dead ends: 613 [2024-11-24 00:38:17,252 INFO L226 Difference]: Without dead ends: 348 [2024-11-24 00:38:17,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:38:17,254 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 328 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:17,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 390 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 00:38:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-24 00:38:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 266. [2024-11-24 00:38:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 206 states have (on average 1.3592233009708738) internal successors, (280), 208 states have internal predecessors, (280), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-24 00:38:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 384 transitions. [2024-11-24 00:38:17,304 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 384 transitions. Word has length 122 [2024-11-24 00:38:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 384 transitions. [2024-11-24 00:38:17,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 384 transitions. [2024-11-24 00:38:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:17,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:17,307 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:17,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:38:17,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1033779144, now seen corresponding path program 1 times [2024-11-24 00:38:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62650258] [2024-11-24 00:38:17,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:17,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:20,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62650258] [2024-11-24 00:38:20,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62650258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:20,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:20,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:38:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079034306] [2024-11-24 00:38:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:20,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:38:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:20,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:38:20,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:38:20,735 INFO L87 Difference]: Start difference. First operand 266 states and 384 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:21,698 INFO L93 Difference]: Finished difference Result 554 states and 773 transitions. [2024-11-24 00:38:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:38:21,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:21,702 INFO L225 Difference]: With dead ends: 554 [2024-11-24 00:38:21,702 INFO L226 Difference]: Without dead ends: 552 [2024-11-24 00:38:21,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:38:21,703 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 116 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:21,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 700 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-24 00:38:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-24 00:38:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 482. [2024-11-24 00:38:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 382 states have (on average 1.3481675392670156) internal successors, (515), 389 states have internal predecessors, (515), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-24 00:38:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 687 transitions. [2024-11-24 00:38:21,820 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 687 transitions. Word has length 123 [2024-11-24 00:38:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:21,821 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 687 transitions. [2024-11-24 00:38:21,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 687 transitions. [2024-11-24 00:38:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:21,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:21,823 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:21,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:38:21,823 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:21,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1491826376, now seen corresponding path program 1 times [2024-11-24 00:38:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:21,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767271671] [2024-11-24 00:38:21,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:21,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:25,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:25,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767271671] [2024-11-24 00:38:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767271671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:38:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908251356] [2024-11-24 00:38:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:38:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:25,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:38:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:38:25,202 INFO L87 Difference]: Start difference. First operand 482 states and 687 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:26,616 INFO L93 Difference]: Finished difference Result 503 states and 705 transitions. [2024-11-24 00:38:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:26,620 INFO L225 Difference]: With dead ends: 503 [2024-11-24 00:38:26,620 INFO L226 Difference]: Without dead ends: 501 [2024-11-24 00:38:26,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:38:26,621 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 898 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 00:38:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-24 00:38:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 461. [2024-11-24 00:38:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 363 states have (on average 1.3471074380165289) internal successors, (489), 369 states have internal predecessors, (489), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-24 00:38:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 657 transitions. [2024-11-24 00:38:26,706 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 657 transitions. Word has length 123 [2024-11-24 00:38:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:26,706 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 657 transitions. [2024-11-24 00:38:26,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 657 transitions. [2024-11-24 00:38:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:26,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:26,708 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:26,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 00:38:26,708 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash 446973130, now seen corresponding path program 1 times [2024-11-24 00:38:26,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:26,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113411715] [2024-11-24 00:38:26,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:30,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:30,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113411715] [2024-11-24 00:38:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113411715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:30,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:38:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398501166] [2024-11-24 00:38:30,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:38:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:30,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:38:30,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:38:30,047 INFO L87 Difference]: Start difference. First operand 461 states and 657 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:31,099 INFO L93 Difference]: Finished difference Result 1099 states and 1533 transitions. [2024-11-24 00:38:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:31,103 INFO L225 Difference]: With dead ends: 1099 [2024-11-24 00:38:31,104 INFO L226 Difference]: Without dead ends: 641 [2024-11-24 00:38:31,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-24 00:38:31,105 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 152 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:31,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 628 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 00:38:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-24 00:38:31,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 518. [2024-11-24 00:38:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 417 states have (on average 1.3381294964028776) internal successors, (558), 424 states have internal predecessors, (558), 86 states have call successors, (86), 14 states have call predecessors, (86), 14 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-24 00:38:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 730 transitions. [2024-11-24 00:38:31,200 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 730 transitions. Word has length 123 [2024-11-24 00:38:31,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:31,201 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 730 transitions. [2024-11-24 00:38:31,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 730 transitions. [2024-11-24 00:38:31,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:31,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:31,203 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:31,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 00:38:31,203 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:31,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 905020362, now seen corresponding path program 1 times [2024-11-24 00:38:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055626457] [2024-11-24 00:38:31,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055626457] [2024-11-24 00:38:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055626457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:38:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162951633] [2024-11-24 00:38:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:38:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:32,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:38:32,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:38:32,814 INFO L87 Difference]: Start difference. First operand 518 states and 730 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:34,145 INFO L93 Difference]: Finished difference Result 1148 states and 1602 transitions. [2024-11-24 00:38:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:34,149 INFO L225 Difference]: With dead ends: 1148 [2024-11-24 00:38:34,149 INFO L226 Difference]: Without dead ends: 633 [2024-11-24 00:38:34,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-24 00:38:34,151 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 179 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:34,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1048 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 00:38:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-24 00:38:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 525. [2024-11-24 00:38:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 424 states have (on average 1.3419811320754718) internal successors, (569), 431 states have internal predecessors, (569), 86 states have call successors, (86), 14 states have call predecessors, (86), 14 states have return successors, (86), 79 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-24 00:38:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 741 transitions. [2024-11-24 00:38:34,243 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 741 transitions. Word has length 123 [2024-11-24 00:38:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:34,243 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 741 transitions. [2024-11-24 00:38:34,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 741 transitions. [2024-11-24 00:38:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:34,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:34,245 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 00:38:34,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1171822600, now seen corresponding path program 1 times [2024-11-24 00:38:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520057678] [2024-11-24 00:38:34,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520057678] [2024-11-24 00:38:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520057678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:38,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:38:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117369596] [2024-11-24 00:38:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:38,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:38:38,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:38,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:38:38,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:38:38,189 INFO L87 Difference]: Start difference. First operand 525 states and 741 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:39,608 INFO L93 Difference]: Finished difference Result 588 states and 809 transitions. [2024-11-24 00:38:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:39,612 INFO L225 Difference]: With dead ends: 588 [2024-11-24 00:38:39,612 INFO L226 Difference]: Without dead ends: 586 [2024-11-24 00:38:39,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:38:39,613 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 204 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:39,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 865 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-24 00:38:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-11-24 00:38:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 490. [2024-11-24 00:38:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 391 states have (on average 1.3350383631713556) internal successors, (522), 397 states have internal predecessors, (522), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-24 00:38:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 690 transitions. [2024-11-24 00:38:39,703 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 690 transitions. Word has length 123 [2024-11-24 00:38:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:39,703 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 690 transitions. [2024-11-24 00:38:39,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 690 transitions. [2024-11-24 00:38:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:39,705 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:39,705 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-24 00:38:39,705 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 585016586, now seen corresponding path program 1 times [2024-11-24 00:38:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650669435] [2024-11-24 00:38:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650669435] [2024-11-24 00:38:44,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650669435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:44,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-24 00:38:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293530948] [2024-11-24 00:38:44,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:44,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-24 00:38:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:44,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-24 00:38:44,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:38:44,261 INFO L87 Difference]: Start difference. First operand 490 states and 690 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:47,821 INFO L93 Difference]: Finished difference Result 703 states and 952 transitions. [2024-11-24 00:38:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 00:38:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:47,825 INFO L225 Difference]: With dead ends: 703 [2024-11-24 00:38:47,825 INFO L226 Difference]: Without dead ends: 701 [2024-11-24 00:38:47,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2024-11-24 00:38:47,828 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 304 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:47,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1279 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-24 00:38:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-24 00:38:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 489. [2024-11-24 00:38:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 390 states have (on average 1.3358974358974358) internal successors, (521), 396 states have internal predecessors, (521), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-24 00:38:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 689 transitions. [2024-11-24 00:38:47,921 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 689 transitions. Word has length 123 [2024-11-24 00:38:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 689 transitions. [2024-11-24 00:38:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 689 transitions. [2024-11-24 00:38:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:47,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:47,923 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:47,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 00:38:47,924 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:47,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1547171576, now seen corresponding path program 1 times [2024-11-24 00:38:47,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721429516] [2024-11-24 00:38:47,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:50,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:50,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721429516] [2024-11-24 00:38:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721429516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:38:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881092657] [2024-11-24 00:38:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 00:38:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:50,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 00:38:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-24 00:38:50,753 INFO L87 Difference]: Start difference. First operand 489 states and 689 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:51,677 INFO L93 Difference]: Finished difference Result 1180 states and 1625 transitions. [2024-11-24 00:38:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 00:38:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:51,681 INFO L225 Difference]: With dead ends: 1180 [2024-11-24 00:38:51,681 INFO L226 Difference]: Without dead ends: 694 [2024-11-24 00:38:51,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:38:51,683 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:51,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 710 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-24 00:38:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-24 00:38:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 499. [2024-11-24 00:38:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 400 states have (on average 1.3275) internal successors, (531), 406 states have internal predecessors, (531), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-24 00:38:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 699 transitions. [2024-11-24 00:38:51,780 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 699 transitions. Word has length 123 [2024-11-24 00:38:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:51,781 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 699 transitions. [2024-11-24 00:38:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 699 transitions. [2024-11-24 00:38:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-24 00:38:51,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:51,782 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 00:38:51,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:51,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1409128120, now seen corresponding path program 1 times [2024-11-24 00:38:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:51,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006655461] [2024-11-24 00:38:51,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006655461] [2024-11-24 00:38:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006655461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:53,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:53,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-24 00:38:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808846719] [2024-11-24 00:38:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:38:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:53,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:38:53,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:38:53,277 INFO L87 Difference]: Start difference. First operand 499 states and 699 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:54,641 INFO L93 Difference]: Finished difference Result 597 states and 811 transitions. [2024-11-24 00:38:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-24 00:38:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-24 00:38:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:54,645 INFO L225 Difference]: With dead ends: 597 [2024-11-24 00:38:54,645 INFO L226 Difference]: Without dead ends: 595 [2024-11-24 00:38:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-24 00:38:54,647 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 175 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 889 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 00:38:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-24 00:38:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 498. [2024-11-24 00:38:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 399 states have (on average 1.3283208020050126) internal successors, (530), 405 states have internal predecessors, (530), 84 states have call successors, (84), 14 states have call predecessors, (84), 14 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-24 00:38:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 698 transitions. [2024-11-24 00:38:54,743 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 698 transitions. Word has length 123 [2024-11-24 00:38:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:54,743 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 698 transitions. [2024-11-24 00:38:54,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 698 transitions. [2024-11-24 00:38:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 00:38:54,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:54,745 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:54,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 00:38:54,746 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1580058015, now seen corresponding path program 1 times [2024-11-24 00:38:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441272053] [2024-11-24 00:38:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441272053] [2024-11-24 00:38:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441272053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:38:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734328180] [2024-11-24 00:38:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:54,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:38:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:54,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:38:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:38:54,852 INFO L87 Difference]: Start difference. First operand 498 states and 698 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:55,193 INFO L93 Difference]: Finished difference Result 1117 states and 1564 transitions. [2024-11-24 00:38:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:38:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-24 00:38:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:55,197 INFO L225 Difference]: With dead ends: 1117 [2024-11-24 00:38:55,197 INFO L226 Difference]: Without dead ends: 622 [2024-11-24 00:38:55,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:38:55,199 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:55,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 372 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:38:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-24 00:38:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 486. [2024-11-24 00:38:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 383 states have (on average 1.328981723237598) internal successors, (509), 389 states have internal predecessors, (509), 88 states have call successors, (88), 14 states have call predecessors, (88), 14 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-24 00:38:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 685 transitions. [2024-11-24 00:38:55,300 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 685 transitions. Word has length 125 [2024-11-24 00:38:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:55,300 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 685 transitions. [2024-11-24 00:38:55,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 685 transitions. [2024-11-24 00:38:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-24 00:38:55,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:55,301 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:55,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-24 00:38:55,302 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 157896545, now seen corresponding path program 1 times [2024-11-24 00:38:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:55,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447370589] [2024-11-24 00:38:55,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447370589] [2024-11-24 00:38:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447370589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:38:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68867155] [2024-11-24 00:38:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:38:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:38:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:38:55,422 INFO L87 Difference]: Start difference. First operand 486 states and 685 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:55,764 INFO L93 Difference]: Finished difference Result 1192 states and 1682 transitions. [2024-11-24 00:38:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:38:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-24 00:38:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:55,767 INFO L225 Difference]: With dead ends: 1192 [2024-11-24 00:38:55,767 INFO L226 Difference]: Without dead ends: 709 [2024-11-24 00:38:55,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:38:55,769 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:55,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 311 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:38:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-24 00:38:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 567. [2024-11-24 00:38:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 464 states have (on average 1.353448275862069) internal successors, (628), 470 states have internal predecessors, (628), 88 states have call successors, (88), 14 states have call predecessors, (88), 14 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-24 00:38:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 804 transitions. [2024-11-24 00:38:55,845 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 804 transitions. Word has length 125 [2024-11-24 00:38:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 804 transitions. [2024-11-24 00:38:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 804 transitions. [2024-11-24 00:38:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-24 00:38:55,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:55,847 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:55,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-24 00:38:55,848 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1012422610, now seen corresponding path program 1 times [2024-11-24 00:38:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:55,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217971130] [2024-11-24 00:38:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217971130] [2024-11-24 00:38:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217971130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:55,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:55,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:38:55,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380147753] [2024-11-24 00:38:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:55,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:38:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:55,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:38:55,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:38:55,903 INFO L87 Difference]: Start difference. First operand 567 states and 804 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:56,065 INFO L93 Difference]: Finished difference Result 1409 states and 1964 transitions. [2024-11-24 00:38:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:38:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-24 00:38:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:56,068 INFO L225 Difference]: With dead ends: 1409 [2024-11-24 00:38:56,068 INFO L226 Difference]: Without dead ends: 845 [2024-11-24 00:38:56,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:38:56,069 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:56,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 184 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:38:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-24 00:38:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2024-11-24 00:38:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 682 states have (on average 1.278592375366569) internal successors, (872), 696 states have internal predecessors, (872), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 114 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-24 00:38:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1128 transitions. [2024-11-24 00:38:56,249 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1128 transitions. Word has length 126 [2024-11-24 00:38:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:56,249 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1128 transitions. [2024-11-24 00:38:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1128 transitions. [2024-11-24 00:38:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:38:56,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:56,251 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:56,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-24 00:38:56,251 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:56,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash 329268711, now seen corresponding path program 1 times [2024-11-24 00:38:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62765819] [2024-11-24 00:38:56,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:38:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:38:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:38:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62765819] [2024-11-24 00:38:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62765819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:38:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:38:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:38:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252994486] [2024-11-24 00:38:56,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:38:56,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:38:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:38:56,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:38:56,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:38:56,319 INFO L87 Difference]: Start difference. First operand 837 states and 1128 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:38:56,569 INFO L93 Difference]: Finished difference Result 1630 states and 2182 transitions. [2024-11-24 00:38:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:38:56,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:38:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:38:56,573 INFO L225 Difference]: With dead ends: 1630 [2024-11-24 00:38:56,574 INFO L226 Difference]: Without dead ends: 796 [2024-11-24 00:38:56,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:38:56,576 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 00:38:56,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 184 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 00:38:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-24 00:38:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 585. [2024-11-24 00:38:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 494 states have (on average 1.2834008097165992) internal successors, (634), 500 states have internal predecessors, (634), 72 states have call successors, (72), 18 states have call predecessors, (72), 18 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-24 00:38:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 778 transitions. [2024-11-24 00:38:56,668 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 778 transitions. Word has length 127 [2024-11-24 00:38:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:38:56,668 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 778 transitions. [2024-11-24 00:38:56,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:38:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 778 transitions. [2024-11-24 00:38:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:38:56,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:38:56,670 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:38:56,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-24 00:38:56,670 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:38:56,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:38:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1489645638, now seen corresponding path program 1 times [2024-11-24 00:38:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:38:56,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212150849] [2024-11-24 00:38:56,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:38:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:38:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212150849] [2024-11-24 00:39:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212150849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 00:39:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600855004] [2024-11-24 00:39:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:02,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 00:39:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:02,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 00:39:02,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:39:02,622 INFO L87 Difference]: Start difference. First operand 585 states and 778 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:05,669 INFO L93 Difference]: Finished difference Result 934 states and 1171 transitions. [2024-11-24 00:39:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 00:39:05,669 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2024-11-24 00:39:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:05,672 INFO L225 Difference]: With dead ends: 934 [2024-11-24 00:39:05,672 INFO L226 Difference]: Without dead ends: 932 [2024-11-24 00:39:05,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-11-24 00:39:05,673 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 240 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:05,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 606 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 00:39:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-24 00:39:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 794. [2024-11-24 00:39:05,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 670 states have (on average 1.2402985074626867) internal successors, (831), 681 states have internal predecessors, (831), 94 states have call successors, (94), 29 states have call predecessors, (94), 29 states have return successors, (94), 83 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-24 00:39:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1019 transitions. [2024-11-24 00:39:05,780 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1019 transitions. Word has length 127 [2024-11-24 00:39:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:05,780 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1019 transitions. [2024-11-24 00:39:05,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1019 transitions. [2024-11-24 00:39:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:05,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:05,782 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:05,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-24 00:39:05,782 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 607080122, now seen corresponding path program 1 times [2024-11-24 00:39:05,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:05,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236081282] [2024-11-24 00:39:05,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236081282] [2024-11-24 00:39:09,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236081282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 00:39:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635057453] [2024-11-24 00:39:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:39:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:09,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:39:09,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:39:09,509 INFO L87 Difference]: Start difference. First operand 794 states and 1019 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:11,660 INFO L93 Difference]: Finished difference Result 928 states and 1177 transitions. [2024-11-24 00:39:11,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:39:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:11,665 INFO L225 Difference]: With dead ends: 928 [2024-11-24 00:39:11,665 INFO L226 Difference]: Without dead ends: 926 [2024-11-24 00:39:11,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:39:11,666 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 187 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:11,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1300 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-24 00:39:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-24 00:39:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 885. [2024-11-24 00:39:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 745 states have (on average 1.2335570469798658) internal successors, (919), 759 states have internal predecessors, (919), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 92 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 00:39:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1131 transitions. [2024-11-24 00:39:11,871 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1131 transitions. Word has length 127 [2024-11-24 00:39:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:11,871 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1131 transitions. [2024-11-24 00:39:11,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1131 transitions. [2024-11-24 00:39:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:11,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:11,873 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:11,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-24 00:39:11,873 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:11,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1525457980, now seen corresponding path program 1 times [2024-11-24 00:39:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86296134] [2024-11-24 00:39:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:15,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:15,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86296134] [2024-11-24 00:39:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86296134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 00:39:15,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869740555] [2024-11-24 00:39:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:15,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 00:39:15,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:15,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 00:39:15,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-24 00:39:15,757 INFO L87 Difference]: Start difference. First operand 885 states and 1131 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:17,316 INFO L93 Difference]: Finished difference Result 1884 states and 2395 transitions. [2024-11-24 00:39:17,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:39:17,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:17,321 INFO L225 Difference]: With dead ends: 1884 [2024-11-24 00:39:17,321 INFO L226 Difference]: Without dead ends: 1017 [2024-11-24 00:39:17,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2024-11-24 00:39:17,324 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 132 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:17,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 874 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 00:39:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-11-24 00:39:17,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 906. [2024-11-24 00:39:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 766 states have (on average 1.2297650130548303) internal successors, (942), 780 states have internal predecessors, (942), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 92 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 00:39:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1154 transitions. [2024-11-24 00:39:17,459 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1154 transitions. Word has length 127 [2024-11-24 00:39:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:17,459 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1154 transitions. [2024-11-24 00:39:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1154 transitions. [2024-11-24 00:39:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:17,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:17,461 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:17,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-24 00:39:17,461 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:17,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -672783556, now seen corresponding path program 1 times [2024-11-24 00:39:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967596133] [2024-11-24 00:39:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:19,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967596133] [2024-11-24 00:39:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967596133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:19,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-24 00:39:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146845550] [2024-11-24 00:39:19,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:19,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-24 00:39:19,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:19,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-24 00:39:19,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-24 00:39:19,304 INFO L87 Difference]: Start difference. First operand 906 states and 1154 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:21,204 INFO L93 Difference]: Finished difference Result 967 states and 1216 transitions. [2024-11-24 00:39:21,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-24 00:39:21,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:21,209 INFO L225 Difference]: With dead ends: 967 [2024-11-24 00:39:21,209 INFO L226 Difference]: Without dead ends: 965 [2024-11-24 00:39:21,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2024-11-24 00:39:21,210 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 204 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:21,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1016 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 00:39:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-24 00:39:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 900. [2024-11-24 00:39:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 760 states have (on average 1.231578947368421) internal successors, (936), 774 states have internal predecessors, (936), 106 states have call successors, (106), 33 states have call predecessors, (106), 33 states have return successors, (106), 92 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-24 00:39:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1148 transitions. [2024-11-24 00:39:21,392 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1148 transitions. Word has length 127 [2024-11-24 00:39:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1148 transitions. [2024-11-24 00:39:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1148 transitions. [2024-11-24 00:39:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:21,394 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:21,394 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-24 00:39:21,395 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -797374342, now seen corresponding path program 1 times [2024-11-24 00:39:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624765579] [2024-11-24 00:39:21,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624765579] [2024-11-24 00:39:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624765579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 00:39:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720062359] [2024-11-24 00:39:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:25,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:39:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:25,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:39:25,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:39:25,596 INFO L87 Difference]: Start difference. First operand 900 states and 1148 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:27,682 INFO L93 Difference]: Finished difference Result 1081 states and 1358 transitions. [2024-11-24 00:39:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:39:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:27,687 INFO L225 Difference]: With dead ends: 1081 [2024-11-24 00:39:27,687 INFO L226 Difference]: Without dead ends: 1079 [2024-11-24 00:39:27,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:39:27,688 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 174 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:27,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 998 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 00:39:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-24 00:39:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1009. [2024-11-24 00:39:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 850 states have (on average 1.22) internal successors, (1037), 867 states have internal predecessors, (1037), 120 states have call successors, (120), 38 states have call predecessors, (120), 38 states have return successors, (120), 103 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-24 00:39:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1277 transitions. [2024-11-24 00:39:27,898 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1277 transitions. Word has length 127 [2024-11-24 00:39:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:27,898 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1277 transitions. [2024-11-24 00:39:27,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1277 transitions. [2024-11-24 00:39:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:27,900 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:27,900 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-24 00:39:27,900 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:27,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2077238020, now seen corresponding path program 1 times [2024-11-24 00:39:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837092286] [2024-11-24 00:39:27,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837092286] [2024-11-24 00:39:29,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837092286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:29,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:29,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-24 00:39:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124932804] [2024-11-24 00:39:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:29,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-24 00:39:29,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:29,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-24 00:39:29,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-24 00:39:29,505 INFO L87 Difference]: Start difference. First operand 1009 states and 1277 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:31,972 INFO L93 Difference]: Finished difference Result 2546 states and 3192 transitions. [2024-11-24 00:39:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 00:39:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:31,978 INFO L225 Difference]: With dead ends: 2546 [2024-11-24 00:39:31,978 INFO L226 Difference]: Without dead ends: 1555 [2024-11-24 00:39:31,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2024-11-24 00:39:31,981 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 179 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:31,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1020 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-24 00:39:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-24 00:39:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1371. [2024-11-24 00:39:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1162 states have (on average 1.2117039586919105) internal successors, (1408), 1182 states have internal predecessors, (1408), 158 states have call successors, (158), 50 states have call predecessors, (158), 50 states have return successors, (158), 138 states have call predecessors, (158), 158 states have call successors, (158) [2024-11-24 00:39:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1724 transitions. [2024-11-24 00:39:32,201 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1724 transitions. Word has length 127 [2024-11-24 00:39:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:32,202 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1724 transitions. [2024-11-24 00:39:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1724 transitions. [2024-11-24 00:39:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:32,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:32,203 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:32,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-24 00:39:32,203 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:32,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1270790920, now seen corresponding path program 1 times [2024-11-24 00:39:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:32,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776691020] [2024-11-24 00:39:32,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:32,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:35,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776691020] [2024-11-24 00:39:35,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776691020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:35,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:35,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 00:39:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150689664] [2024-11-24 00:39:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:39:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:35,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:39:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:39:35,522 INFO L87 Difference]: Start difference. First operand 1371 states and 1724 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:37,465 INFO L93 Difference]: Finished difference Result 1581 states and 1935 transitions. [2024-11-24 00:39:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 00:39:37,465 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2024-11-24 00:39:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:37,469 INFO L225 Difference]: With dead ends: 1581 [2024-11-24 00:39:37,469 INFO L226 Difference]: Without dead ends: 1579 [2024-11-24 00:39:37,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-11-24 00:39:37,470 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 153 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:37,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 750 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 00:39:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-11-24 00:39:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 696. [2024-11-24 00:39:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 610 states have (on average 1.318032786885246) internal successors, (804), 613 states have internal predecessors, (804), 64 states have call successors, (64), 21 states have call predecessors, (64), 21 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-24 00:39:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 932 transitions. [2024-11-24 00:39:37,571 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 932 transitions. Word has length 127 [2024-11-24 00:39:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:37,572 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 932 transitions. [2024-11-24 00:39:37,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 932 transitions. [2024-11-24 00:39:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:37,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:37,573 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:37,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-24 00:39:37,573 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:37,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1744312698, now seen corresponding path program 1 times [2024-11-24 00:39:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:37,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438769786] [2024-11-24 00:39:37,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:37,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438769786] [2024-11-24 00:39:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438769786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-24 00:39:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948330820] [2024-11-24 00:39:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-24 00:39:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:40,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-24 00:39:40,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-24 00:39:40,787 INFO L87 Difference]: Start difference. First operand 696 states and 932 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:42,119 INFO L93 Difference]: Finished difference Result 1584 states and 2051 transitions. [2024-11-24 00:39:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-24 00:39:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:42,125 INFO L225 Difference]: With dead ends: 1584 [2024-11-24 00:39:42,125 INFO L226 Difference]: Without dead ends: 1072 [2024-11-24 00:39:42,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-24 00:39:42,127 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 87 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:42,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 904 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-24 00:39:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-24 00:39:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 726. [2024-11-24 00:39:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 637 states have (on average 1.2967032967032968) internal successors, (826), 641 states have internal predecessors, (826), 66 states have call successors, (66), 22 states have call predecessors, (66), 22 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-24 00:39:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 958 transitions. [2024-11-24 00:39:42,226 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 958 transitions. Word has length 127 [2024-11-24 00:39:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 958 transitions. [2024-11-24 00:39:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 958 transitions. [2024-11-24 00:39:42,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-24 00:39:42,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:42,227 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-24 00:39:42,227 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -453928838, now seen corresponding path program 1 times [2024-11-24 00:39:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195070234] [2024-11-24 00:39:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:39:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195070234] [2024-11-24 00:39:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195070234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:45,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-24 00:39:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000100760] [2024-11-24 00:39:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:45,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:39:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:39:45,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:39:45,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-24 00:39:45,885 INFO L87 Difference]: Start difference. First operand 726 states and 958 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:47,633 INFO L93 Difference]: Finished difference Result 832 states and 1071 transitions. [2024-11-24 00:39:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:39:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-24 00:39:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:47,636 INFO L225 Difference]: With dead ends: 832 [2024-11-24 00:39:47,636 INFO L226 Difference]: Without dead ends: 830 [2024-11-24 00:39:47,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-24 00:39:47,637 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:47,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1100 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-24 00:39:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-24 00:39:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 720. [2024-11-24 00:39:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 631 states have (on average 1.299524564183835) internal successors, (820), 635 states have internal predecessors, (820), 66 states have call successors, (66), 22 states have call predecessors, (66), 22 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-24 00:39:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 952 transitions. [2024-11-24 00:39:47,724 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 952 transitions. Word has length 127 [2024-11-24 00:39:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:47,725 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 952 transitions. [2024-11-24 00:39:47,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 952 transitions. [2024-11-24 00:39:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-24 00:39:47,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:47,726 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:47,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-24 00:39:47,726 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:47,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2113491612, now seen corresponding path program 1 times [2024-11-24 00:39:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:39:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763107062] [2024-11-24 00:39:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:39:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:39:47,769 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:39:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:39:47,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:39:47,888 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:39:47,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 00:39:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-24 00:39:47,895 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:48,007 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 00:39:48,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:39:48 BoogieIcfgContainer [2024-11-24 00:39:48,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 00:39:48,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 00:39:48,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 00:39:48,016 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 00:39:48,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:29:42" (3/4) ... [2024-11-24 00:39:48,019 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 00:39:48,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 00:39:48,021 INFO L158 Benchmark]: Toolchain (without parser) took 607066.28ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 92.5MB in the beginning and 635.1MB in the end (delta: -542.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-11-24 00:39:48,022 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:39:48,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.21ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 00:39:48,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.86ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 74.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:39:48,023 INFO L158 Benchmark]: Boogie Preprocessor took 94.51ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 67.2MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 00:39:48,023 INFO L158 Benchmark]: RCFGBuilder took 751.50ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 43.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 00:39:48,024 INFO L158 Benchmark]: TraceAbstraction took 605754.37ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 42.7MB in the beginning and 635.2MB in the end (delta: -592.5MB). Peak memory consumption was 380.2MB. Max. memory is 16.1GB. [2024-11-24 00:39:48,024 INFO L158 Benchmark]: Witness Printer took 5.67ms. Allocated memory is still 704.6MB. Free memory was 635.2MB in the beginning and 635.1MB in the end (delta: 96.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 00:39:48,025 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.85ms. Allocated memory is still 117.4MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.21ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 78.2MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.86ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 74.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 94.51ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 67.2MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 751.50ms. Allocated memory is still 117.4MB. Free memory was 67.2MB in the beginning and 43.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 605754.37ms. Allocated memory was 117.4MB in the beginning and 704.6MB in the end (delta: 587.2MB). Free memory was 42.7MB in the beginning and 635.2MB in the end (delta: -592.5MB). Peak memory consumption was 380.2MB. Max. memory is 16.1GB. * Witness Printer took 5.67ms. Allocated memory is still 704.6MB. Free memory was 635.2MB in the beginning and 635.1MB in the end (delta: 96.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 111, overapproximation of shiftLeft at line 111, overapproximation of shiftLeft at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] unsigned short int var_1_4 = 58792; [L24] unsigned short int var_1_5 = 8; [L25] unsigned short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 16; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = 1000; [L30] signed short int var_1_11 = 1; [L31] signed short int var_1_12 = -25; [L32] signed short int var_1_13 = 25; [L33] unsigned short int var_1_14 = 5; [L34] unsigned short int var_1_16 = 20511; [L35] unsigned long int var_1_17 = 50; [L36] unsigned short int var_1_18 = 10; [L37] unsigned char last_1_var_1_8 = 0; VAL [isInitial=0, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=58792, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L115] isInitial = 1 [L116] FCALL initially() [L118] CALL updateLastVariables() [L108] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=58792, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L79] var_1_4 = __VERIFIER_nondet_ushort() [L80] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L81] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L81] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L82] var_1_5 = __VERIFIER_nondet_ushort() [L83] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L83] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L84] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L85] var_1_6 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_7=16, var_1_8=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_7=16, var_1_8=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L88] var_1_7 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_8=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L91] var_1_9 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L94] var_1_11 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_11 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_11 <= 8191) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L97] var_1_12 = __VERIFIER_nondet_short() [L98] CALL assume_abort_if_not(var_1_12 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_12 >= -16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L100] var_1_13 = __VERIFIER_nondet_short() [L101] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L102] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L104] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L119] RET updateVariables() [L120] CALL step() [L41] COND FALSE !(last_1_var_1_8 && last_1_var_1_8) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=4, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L44] COND TRUE ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6 [L45] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=0, var_1_9=1] [L48] var_1_8 = (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=5, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L49] COND TRUE \read(var_1_8) [L50] var_1_14 = (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L52] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L52] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=50, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L52] COND TRUE ((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14 [L53] var_1_17 = var_1_11 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L57] COND FALSE !(var_1_5 == var_1_16) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=10, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L64] COND TRUE \read(var_1_9) [L65] var_1_18 = 200 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L68] COND FALSE !(var_1_17 < var_1_6) [L75] var_1_10 = var_1_13 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L111-L112] return ((((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5))))) && ((var_1_5 == var_1_16) ? (var_1_8 ? (var_1_18 == ((unsigned short int) (((((var_1_16 + 30393) - var_1_5) < 0 ) ? -((var_1_16 + 30393) - var_1_5) : ((var_1_16 + 30393) - var_1_5))))) : (var_1_18 == ((unsigned short int) var_1_4))) : (var_1_9 ? (var_1_18 == ((unsigned short int) 200)) : 1)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32542, var_1_11=8191, var_1_12=-6379, var_1_13=32542, var_1_14=32542, var_1_16=32540, var_1_17=8191, var_1_18=200, var_1_1=-57347, var_1_4=-1595679173, var_1_5=-57347, var_1_6=8191, var_1_7=8190, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 605.5s, OverallIterations: 38, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 82.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9150 SdHoareTripleChecker+Valid, 38.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9150 mSDsluCounter, 22114 SdHoareTripleChecker+Invalid, 34.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17579 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19085 IncrementalHoareTripleChecker+Invalid, 19477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 4535 mSDtfsCounter, 19085 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 292 SyntacticMatches, 14 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 73.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1371occurred in iteration=34, InterpolantAutomatonStates: 401, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 4849 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 517.0s InterpolantComputationTime, 4802 NumberOfCodeBlocks, 4802 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4636 ConstructedInterpolants, 0 QuantifiedInterpolants, 53727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 38 InterpolantComputations, 37 PerfectInterpolantSequences, 23222/23256 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 00:39:48,240 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-24 00:39:48,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:39:50,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:39:50,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 00:39:50,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:39:50,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:39:50,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:39:50,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:39:50,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:39:50,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 00:39:50,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 00:39:50,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:39:50,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:39:50,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:39:50,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:39:50,900 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:39:50,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:39:50,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:39:50,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:39:50,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:39:50,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:39:50,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:39:50,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 00:39:50,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:39:50,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:39:50,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:39:50,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:39:50,903 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:39:50,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:39:50,907 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 00:39:50,907 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 00:39:50,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:39:50,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:39:50,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:39:50,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:39:50,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a [2024-11-24 00:39:51,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:39:51,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:39:51,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:39:51,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:39:51,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:39:51,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-11-24 00:39:54,217 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/36b8c382a/dd064d4ffc4b42d8a098d32d5074cd47/FLAG7c8603922 [2024-11-24 00:39:54,531 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:39:54,531 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2024-11-24 00:39:54,555 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/36b8c382a/dd064d4ffc4b42d8a098d32d5074cd47/FLAG7c8603922 [2024-11-24 00:39:54,591 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/data/36b8c382a/dd064d4ffc4b42d8a098d32d5074cd47 [2024-11-24 00:39:54,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:39:54,599 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:39:54,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:39:54,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:39:54,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:39:54,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:54" (1/1) ... [2024-11-24 00:39:54,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9acd145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:54, skipping insertion in model container [2024-11-24 00:39:54,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:39:54" (1/1) ... [2024-11-24 00:39:54,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:39:54,849 WARN L250 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_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2024-11-24 00:39:54,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:39:54,957 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:39:54,970 WARN L250 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_37dc1e28-5332-4442-a40d-1164acffb147/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2024-11-24 00:39:54,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:39:55,017 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:39:55,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55 WrapperNode [2024-11-24 00:39:55,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:39:55,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:39:55,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:39:55,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:39:55,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,058 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-24 00:39:55,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:39:55,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:39:55,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:39:55,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:39:55,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,084 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 00:39:55,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:39:55,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:39:55,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:39:55,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:39:55,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (1/1) ... [2024-11-24 00:39:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:39:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:39:55,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:39:55,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:39:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 00:39:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 00:39:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 00:39:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 00:39:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:39:55,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:39:55,280 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:39:55,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:39:55,654 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-24 00:39:55,654 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:39:55,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:39:55,665 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 00:39:55,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:55 BoogieIcfgContainer [2024-11-24 00:39:55,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:39:55,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:39:55,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:39:55,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:39:55,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:39:54" (1/3) ... [2024-11-24 00:39:55,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742ec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:55, skipping insertion in model container [2024-11-24 00:39:55,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:39:55" (2/3) ... [2024-11-24 00:39:55,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742ec35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:39:55, skipping insertion in model container [2024-11-24 00:39:55,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:39:55" (3/3) ... [2024-11-24 00:39:55,685 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-10.i [2024-11-24 00:39:55,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:39:55,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-10.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 00:39:55,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:39:55,802 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74a1a406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:39:55,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 00:39:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-24 00:39:55,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-24 00:39:55,824 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:55,825 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:55,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 308938585, now seen corresponding path program 1 times [2024-11-24 00:39:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:39:55,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363524444] [2024-11-24 00:39:55,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:55,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:39:55,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:39:55,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:39:55,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 00:39:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:56,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 00:39:56,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:39:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-24 00:39:56,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:39:56,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:39:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363524444] [2024-11-24 00:39:56,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363524444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:56,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:39:56,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426771879] [2024-11-24 00:39:56,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 00:39:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:39:56,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 00:39:56,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:39:56,207 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:56,238 INFO L93 Difference]: Finished difference Result 105 states and 182 transitions. [2024-11-24 00:39:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 00:39:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-24 00:39:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:56,247 INFO L225 Difference]: With dead ends: 105 [2024-11-24 00:39:56,248 INFO L226 Difference]: Without dead ends: 52 [2024-11-24 00:39:56,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 00:39:56,257 INFO L435 NwaCegarLoop]: 78 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, 78 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 [2024-11-24 00:39:56,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 00:39:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-24 00:39:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-24 00:39:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-24 00:39:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-11-24 00:39:56,318 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 115 [2024-11-24 00:39:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:56,319 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-11-24 00:39:56,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-24 00:39:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-11-24 00:39:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-24 00:39:56,325 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:56,326 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:56,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 00:39:56,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:39:56,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:56,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 964274329, now seen corresponding path program 1 times [2024-11-24 00:39:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:39:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899484294] [2024-11-24 00:39:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:56,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:39:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:39:56,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:39:56,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 00:39:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:56,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-24 00:39:56,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:39:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-24 00:39:57,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 00:39:57,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:39:57,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899484294] [2024-11-24 00:39:57,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899484294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:39:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:39:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 00:39:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608091419] [2024-11-24 00:39:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:39:57,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 00:39:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 00:39:57,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 00:39:57,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 00:39:57,118 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:57,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 00:39:57,406 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2024-11-24 00:39:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 00:39:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-24 00:39:57,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 00:39:57,413 INFO L225 Difference]: With dead ends: 177 [2024-11-24 00:39:57,413 INFO L226 Difference]: Without dead ends: 128 [2024-11-24 00:39:57,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:39:57,417 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 79 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 00:39:57,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 242 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 00:39:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-24 00:39:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2024-11-24 00:39:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-24 00:39:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-11-24 00:39:57,466 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 115 [2024-11-24 00:39:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 00:39:57,466 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-11-24 00:39:57,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-24 00:39:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-11-24 00:39:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-24 00:39:57,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 00:39:57,471 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:39:57,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 00:39:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:39:57,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 00:39:57,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:39:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 661880158, now seen corresponding path program 1 times [2024-11-24 00:39:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 00:39:57,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198981391] [2024-11-24 00:39:57,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:39:57,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 00:39:57,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:39:57,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 00:39:57,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 00:39:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:39:57,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-24 00:39:57,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 00:40:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 474 proven. 87 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-24 00:40:00,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 00:40:01,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 00:40:01,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198981391] [2024-11-24 00:40:01,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198981391] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 00:40:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [400444883] [2024-11-24 00:40:01,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:40:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 00:40:01,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 00:40:01,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 00:40:01,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37dc1e28-5332-4442-a40d-1164acffb147/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-24 00:40:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:40:02,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-24 00:40:02,149 INFO L279 TraceCheckSpWp]: Computing forward predicates...