./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:26:01,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:26:01,191 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 20:26:01,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:26:01,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:26:01,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:26:01,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:26:01,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:26:01,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:26:01,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:26:01,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:26:01,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:26:01,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:26:01,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:26:01,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:26:01,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:26:01,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:26:01,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:26:01,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:26:01,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:26:01,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:26:01,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:26:01,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:26:01,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:26:01,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:26:01,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:26:01,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:26:01,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:26:01,247 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-27 20:26:01,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:26:01,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:26:01,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:26:01,586 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:26:01,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:26:01,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-27 20:26:04,565 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/a5aced343/5a75eabc0f1c449095b50195743e8c5e/FLAG59927d624 [2024-11-27 20:26:04,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:26:04,930 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-27 20:26:04,944 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/a5aced343/5a75eabc0f1c449095b50195743e8c5e/FLAG59927d624 [2024-11-27 20:26:04,970 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/a5aced343/5a75eabc0f1c449095b50195743e8c5e [2024-11-27 20:26:04,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:26:04,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:26:04,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:26:04,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:26:04,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:26:04,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:26:04" (1/1) ... [2024-11-27 20:26:04,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6645f16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:04, skipping insertion in model container [2024-11-27 20:26:04,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:26:04" (1/1) ... [2024-11-27 20:26:05,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:26:05,144 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-27 20:26:05,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:26:05,313 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:26:05,323 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-27 20:26:05,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:26:05,435 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:26:05,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05 WrapperNode [2024-11-27 20:26:05,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:26:05,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:26:05,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:26:05,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:26:05,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,568 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 549 [2024-11-27 20:26:05,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:26:05,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:26:05,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:26:05,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:26:05,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,655 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-27 20:26:05,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:26:05,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:26:05,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:26:05,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:26:05,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (1/1) ... [2024-11-27 20:26:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:26:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:26:05,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:26:05,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:26:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:26:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:26:05,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:26:05,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:26:05,991 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:26:05,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:26:07,362 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2024-11-27 20:26:07,363 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:26:07,378 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:26:07,381 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:26:07,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:26:07 BoogieIcfgContainer [2024-11-27 20:26:07,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:26:07,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:26:07,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:26:07,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:26:07,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:26:04" (1/3) ... [2024-11-27 20:26:07,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c31fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:26:07, skipping insertion in model container [2024-11-27 20:26:07,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:26:05" (2/3) ... [2024-11-27 20:26:07,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84c31fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:26:07, skipping insertion in model container [2024-11-27 20:26:07,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:26:07" (3/3) ... [2024-11-27 20:26:07,394 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2024-11-27 20:26:07,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:26:07,414 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:26:07,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:26:07,517 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;@5c9c78e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:26:07,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:26:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-27 20:26:07,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:07,535 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:07,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:07,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -808785509, now seen corresponding path program 1 times [2024-11-27 20:26:07,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:07,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549725366] [2024-11-27 20:26:07,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:07,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:09,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:09,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549725366] [2024-11-27 20:26:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549725366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142758264] [2024-11-27 20:26:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:09,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:09,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:09,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:09,620 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:09,753 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2024-11-27 20:26:09,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-27 20:26:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:09,769 INFO L225 Difference]: With dead ends: 299 [2024-11-27 20:26:09,770 INFO L226 Difference]: Without dead ends: 159 [2024-11-27 20:26:09,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:26:09,779 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 163 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:09,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 667 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-27 20:26:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-27 20:26:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-27 20:26:09,850 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 79 [2024-11-27 20:26:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-27 20:26:09,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:09,853 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-27 20:26:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-27 20:26:09,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:09,859 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:09,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:26:09,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:09,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1698479195, now seen corresponding path program 1 times [2024-11-27 20:26:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:09,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774590898] [2024-11-27 20:26:09,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774590898] [2024-11-27 20:26:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774590898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:10,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:10,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685826383] [2024-11-27 20:26:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:10,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:10,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:10,567 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:10,649 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2024-11-27 20:26:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-27 20:26:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:10,655 INFO L225 Difference]: With dead ends: 304 [2024-11-27 20:26:10,655 INFO L226 Difference]: Without dead ends: 164 [2024-11-27 20:26:10,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:10,656 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 4 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:10,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 892 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-27 20:26:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-27 20:26:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4723926380368098) internal successors, (240), 163 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2024-11-27 20:26:10,676 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 80 [2024-11-27 20:26:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:10,676 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2024-11-27 20:26:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2024-11-27 20:26:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-27 20:26:10,679 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:10,679 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:10,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:26:10,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash 813788120, now seen corresponding path program 1 times [2024-11-27 20:26:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862971835] [2024-11-27 20:26:10,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862971835] [2024-11-27 20:26:11,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862971835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:11,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:11,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:26:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855984473] [2024-11-27 20:26:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:26:11,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:11,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:26:11,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:11,520 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:11,550 INFO L93 Difference]: Finished difference Result 168 states and 244 transitions. [2024-11-27 20:26:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:26:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-27 20:26:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:11,552 INFO L225 Difference]: With dead ends: 168 [2024-11-27 20:26:11,552 INFO L226 Difference]: Without dead ends: 166 [2024-11-27 20:26:11,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:11,554 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:11,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-27 20:26:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-27 20:26:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4666666666666666) internal successors, (242), 165 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2024-11-27 20:26:11,569 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 81 [2024-11-27 20:26:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:11,569 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2024-11-27 20:26:11,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2024-11-27 20:26:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-27 20:26:11,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:11,575 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:26:11,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -540676422, now seen corresponding path program 1 times [2024-11-27 20:26:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118918264] [2024-11-27 20:26:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:14,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118918264] [2024-11-27 20:26:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118918264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:14,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197793139] [2024-11-27 20:26:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:14,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:14,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:14,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:14,538 INFO L87 Difference]: Start difference. First operand 166 states and 242 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:15,012 INFO L93 Difference]: Finished difference Result 468 states and 683 transitions. [2024-11-27 20:26:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:26:15,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-27 20:26:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:15,016 INFO L225 Difference]: With dead ends: 468 [2024-11-27 20:26:15,016 INFO L226 Difference]: Without dead ends: 320 [2024-11-27 20:26:15,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:26:15,022 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 639 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:15,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1360 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:26:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-27 20:26:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 174. [2024-11-27 20:26:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 173 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-27 20:26:15,042 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 82 [2024-11-27 20:26:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:15,043 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-27 20:26:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-27 20:26:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-27 20:26:15,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:15,048 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:15,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:26:15,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:15,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1751935148, now seen corresponding path program 1 times [2024-11-27 20:26:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331401787] [2024-11-27 20:26:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331401787] [2024-11-27 20:26:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331401787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921961211] [2024-11-27 20:26:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:17,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:17,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:17,055 INFO L87 Difference]: Start difference. First operand 174 states and 252 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:17,530 INFO L93 Difference]: Finished difference Result 475 states and 691 transitions. [2024-11-27 20:26:17,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:17,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-27 20:26:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:17,533 INFO L225 Difference]: With dead ends: 475 [2024-11-27 20:26:17,533 INFO L226 Difference]: Without dead ends: 327 [2024-11-27 20:26:17,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:17,535 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 635 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:17,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1338 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:26:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-27 20:26:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 187. [2024-11-27 20:26:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.456989247311828) internal successors, (271), 186 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 271 transitions. [2024-11-27 20:26:17,545 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 271 transitions. Word has length 83 [2024-11-27 20:26:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:17,546 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 271 transitions. [2024-11-27 20:26:17,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 271 transitions. [2024-11-27 20:26:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-27 20:26:17,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:17,548 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:17,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:26:17,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:17,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash -2009296888, now seen corresponding path program 1 times [2024-11-27 20:26:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:17,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992952012] [2024-11-27 20:26:17,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:17,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:19,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992952012] [2024-11-27 20:26:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992952012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:19,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883057093] [2024-11-27 20:26:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:19,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:19,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:19,132 INFO L87 Difference]: Start difference. First operand 187 states and 271 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:19,482 INFO L93 Difference]: Finished difference Result 480 states and 698 transitions. [2024-11-27 20:26:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:19,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-27 20:26:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:19,488 INFO L225 Difference]: With dead ends: 480 [2024-11-27 20:26:19,488 INFO L226 Difference]: Without dead ends: 332 [2024-11-27 20:26:19,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:19,489 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 424 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:19,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1343 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:26:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-27 20:26:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 200. [2024-11-27 20:26:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 199 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2024-11-27 20:26:19,511 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 84 [2024-11-27 20:26:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:19,511 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2024-11-27 20:26:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2024-11-27 20:26:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-27 20:26:19,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:19,518 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:19,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:26:19,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:19,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:19,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2015780803, now seen corresponding path program 1 times [2024-11-27 20:26:19,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:19,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226792705] [2024-11-27 20:26:19,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:19,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226792705] [2024-11-27 20:26:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226792705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:20,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:20,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:20,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981286474] [2024-11-27 20:26:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:20,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:20,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:20,681 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:20,851 INFO L93 Difference]: Finished difference Result 370 states and 537 transitions. [2024-11-27 20:26:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-27 20:26:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:20,853 INFO L225 Difference]: With dead ends: 370 [2024-11-27 20:26:20,853 INFO L226 Difference]: Without dead ends: 209 [2024-11-27 20:26:20,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:20,854 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:20,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1492 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-27 20:26:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-27 20:26:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2024-11-27 20:26:20,861 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 84 [2024-11-27 20:26:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:20,861 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2024-11-27 20:26:20,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2024-11-27 20:26:20,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-27 20:26:20,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:20,863 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:20,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:26:20,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:20,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:20,863 INFO L85 PathProgramCache]: Analyzing trace with hash 268254877, now seen corresponding path program 1 times [2024-11-27 20:26:20,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:20,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585503976] [2024-11-27 20:26:20,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585503976] [2024-11-27 20:26:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585503976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:21,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:21,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:26:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64660900] [2024-11-27 20:26:21,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:21,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:26:21,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:26:21,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:21,635 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:21,662 INFO L93 Difference]: Finished difference Result 379 states and 549 transitions. [2024-11-27 20:26:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:26:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-27 20:26:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:21,664 INFO L225 Difference]: With dead ends: 379 [2024-11-27 20:26:21,664 INFO L226 Difference]: Without dead ends: 203 [2024-11-27 20:26:21,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:21,665 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:21,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-27 20:26:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-27 20:26:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4405940594059405) internal successors, (291), 202 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2024-11-27 20:26:21,675 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 84 [2024-11-27 20:26:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:21,675 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2024-11-27 20:26:21,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2024-11-27 20:26:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-27 20:26:21,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:21,677 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:21,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:26:21,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:21,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 498255101, now seen corresponding path program 1 times [2024-11-27 20:26:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:21,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086024444] [2024-11-27 20:26:21,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086024444] [2024-11-27 20:26:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086024444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:22,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:26:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680905549] [2024-11-27 20:26:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:26:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:22,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:26:22,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:22,715 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:22,758 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2024-11-27 20:26:22,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:26:22,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-27 20:26:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:22,761 INFO L225 Difference]: With dead ends: 368 [2024-11-27 20:26:22,761 INFO L226 Difference]: Without dead ends: 190 [2024-11-27 20:26:22,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-27 20:26:22,763 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:22,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 660 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-27 20:26:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-27 20:26:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.433862433862434) internal successors, (271), 189 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 271 transitions. [2024-11-27 20:26:22,785 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 271 transitions. Word has length 84 [2024-11-27 20:26:22,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:22,785 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 271 transitions. [2024-11-27 20:26:22,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 271 transitions. [2024-11-27 20:26:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:26:22,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:22,787 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:22,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:26:22,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1636798918, now seen corresponding path program 1 times [2024-11-27 20:26:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266432086] [2024-11-27 20:26:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266432086] [2024-11-27 20:26:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266432086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:24,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:24,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:24,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784786982] [2024-11-27 20:26:24,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:24,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:24,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:24,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:24,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:24,048 INFO L87 Difference]: Start difference. First operand 190 states and 271 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:24,421 INFO L93 Difference]: Finished difference Result 478 states and 689 transitions. [2024-11-27 20:26:24,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:24,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-27 20:26:24,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:24,423 INFO L225 Difference]: With dead ends: 478 [2024-11-27 20:26:24,424 INFO L226 Difference]: Without dead ends: 327 [2024-11-27 20:26:24,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:24,425 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 405 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:24,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1303 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:26:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-27 20:26:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2024-11-27 20:26:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 202 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions. [2024-11-27 20:26:24,434 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 85 [2024-11-27 20:26:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:24,434 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 289 transitions. [2024-11-27 20:26:24,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions. [2024-11-27 20:26:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:26:24,435 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:24,435 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:24,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:26:24,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1025499375, now seen corresponding path program 1 times [2024-11-27 20:26:24,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:24,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549787575] [2024-11-27 20:26:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:25,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:25,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549787575] [2024-11-27 20:26:25,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549787575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:25,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:25,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:26:25,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509469125] [2024-11-27 20:26:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:25,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:26:25,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:25,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:26:25,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:26:25,779 INFO L87 Difference]: Start difference. First operand 203 states and 289 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:26,043 INFO L93 Difference]: Finished difference Result 382 states and 548 transitions. [2024-11-27 20:26:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:26:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-27 20:26:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:26,045 INFO L225 Difference]: With dead ends: 382 [2024-11-27 20:26:26,045 INFO L226 Difference]: Without dead ends: 218 [2024-11-27 20:26:26,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:26:26,047 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:26,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1836 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-27 20:26:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-27 20:26:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4232558139534883) internal successors, (306), 215 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 306 transitions. [2024-11-27 20:26:26,062 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 306 transitions. Word has length 85 [2024-11-27 20:26:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:26,063 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 306 transitions. [2024-11-27 20:26:26,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 306 transitions. [2024-11-27 20:26:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-27 20:26:26,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:26,066 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:26,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:26:26,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 160542543, now seen corresponding path program 1 times [2024-11-27 20:26:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105254712] [2024-11-27 20:26:26,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105254712] [2024-11-27 20:26:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105254712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:27,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:27,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141881212] [2024-11-27 20:26:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:27,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:27,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:27,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:27,068 INFO L87 Difference]: Start difference. First operand 216 states and 306 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:27,196 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2024-11-27 20:26:27,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-27 20:26:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:27,198 INFO L225 Difference]: With dead ends: 399 [2024-11-27 20:26:27,198 INFO L226 Difference]: Without dead ends: 226 [2024-11-27 20:26:27,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:27,199 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 3 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:27,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1265 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-27 20:26:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-11-27 20:26:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2024-11-27 20:26:27,207 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 85 [2024-11-27 20:26:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:27,208 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2024-11-27 20:26:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2024-11-27 20:26:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 20:26:27,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:27,209 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:26:27,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:27,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:27,210 INFO L85 PathProgramCache]: Analyzing trace with hash -802047253, now seen corresponding path program 1 times [2024-11-27 20:26:27,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:27,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071201971] [2024-11-27 20:26:27,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071201971] [2024-11-27 20:26:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071201971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622349191] [2024-11-27 20:26:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:28,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:28,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:28,199 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:28,439 INFO L93 Difference]: Finished difference Result 403 states and 576 transitions. [2024-11-27 20:26:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-27 20:26:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:28,441 INFO L225 Difference]: With dead ends: 403 [2024-11-27 20:26:28,441 INFO L226 Difference]: Without dead ends: 234 [2024-11-27 20:26:28,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:28,442 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 3 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:28,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1279 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-27 20:26:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2024-11-27 20:26:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 228 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2024-11-27 20:26:28,451 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 86 [2024-11-27 20:26:28,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2024-11-27 20:26:28,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2024-11-27 20:26:28,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 20:26:28,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:28,453 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:28,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:26:28,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:28,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1987926186, now seen corresponding path program 1 times [2024-11-27 20:26:28,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:28,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493087960] [2024-11-27 20:26:28,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:28,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493087960] [2024-11-27 20:26:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493087960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017232241] [2024-11-27 20:26:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:29,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:29,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:29,594 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:29,930 INFO L93 Difference]: Finished difference Result 533 states and 762 transitions. [2024-11-27 20:26:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-27 20:26:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:29,932 INFO L225 Difference]: With dead ends: 533 [2024-11-27 20:26:29,933 INFO L226 Difference]: Without dead ends: 358 [2024-11-27 20:26:29,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:29,937 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 575 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:29,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1364 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-27 20:26:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 242. [2024-11-27 20:26:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4149377593360997) internal successors, (341), 241 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 341 transitions. [2024-11-27 20:26:29,947 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 341 transitions. Word has length 86 [2024-11-27 20:26:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:29,948 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 341 transitions. [2024-11-27 20:26:29,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 341 transitions. [2024-11-27 20:26:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 20:26:29,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:29,949 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:29,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:26:29,950 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2133214069, now seen corresponding path program 1 times [2024-11-27 20:26:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175391842] [2024-11-27 20:26:29,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:31,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175391842] [2024-11-27 20:26:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175391842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:31,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 20:26:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489046597] [2024-11-27 20:26:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:31,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 20:26:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:31,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 20:26:31,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:26:31,485 INFO L87 Difference]: Start difference. First operand 242 states and 341 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:31,870 INFO L93 Difference]: Finished difference Result 450 states and 640 transitions. [2024-11-27 20:26:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 20:26:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-27 20:26:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:31,872 INFO L225 Difference]: With dead ends: 450 [2024-11-27 20:26:31,873 INFO L226 Difference]: Without dead ends: 262 [2024-11-27 20:26:31,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-27 20:26:31,874 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:31,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2573 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:26:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-27 20:26:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2024-11-27 20:26:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 258 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 364 transitions. [2024-11-27 20:26:31,882 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 364 transitions. Word has length 86 [2024-11-27 20:26:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:31,883 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 364 transitions. [2024-11-27 20:26:31,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2024-11-27 20:26:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 20:26:31,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:31,884 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:31,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:26:31,885 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:31,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1233244, now seen corresponding path program 1 times [2024-11-27 20:26:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334559954] [2024-11-27 20:26:31,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:32,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:32,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334559954] [2024-11-27 20:26:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334559954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:32,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:32,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376316385] [2024-11-27 20:26:32,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:32,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:32,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:32,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:32,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:32,510 INFO L87 Difference]: Start difference. First operand 259 states and 364 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:32,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:32,628 INFO L93 Difference]: Finished difference Result 599 states and 849 transitions. [2024-11-27 20:26:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-11-27 20:26:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:32,630 INFO L225 Difference]: With dead ends: 599 [2024-11-27 20:26:32,630 INFO L226 Difference]: Without dead ends: 372 [2024-11-27 20:26:32,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:26:32,631 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 399 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:32,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 611 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-27 20:26:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 259. [2024-11-27 20:26:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4069767441860466) internal successors, (363), 258 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2024-11-27 20:26:32,643 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 86 [2024-11-27 20:26:32,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:32,643 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2024-11-27 20:26:32,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2024-11-27 20:26:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-27 20:26:32,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:32,645 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:32,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:26:32,645 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:32,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash -696215096, now seen corresponding path program 1 times [2024-11-27 20:26:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:32,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98021795] [2024-11-27 20:26:32,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:33,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:33,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98021795] [2024-11-27 20:26:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98021795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:33,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:33,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889760550] [2024-11-27 20:26:33,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:33,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:33,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:33,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:33,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:33,613 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:33,899 INFO L93 Difference]: Finished difference Result 569 states and 810 transitions. [2024-11-27 20:26:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:33,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-27 20:26:33,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:33,902 INFO L225 Difference]: With dead ends: 569 [2024-11-27 20:26:33,902 INFO L226 Difference]: Without dead ends: 380 [2024-11-27 20:26:33,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:33,903 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 392 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:33,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1365 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-27 20:26:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 272. [2024-11-27 20:26:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4059040590405905) internal successors, (381), 271 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 381 transitions. [2024-11-27 20:26:33,914 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 381 transitions. Word has length 87 [2024-11-27 20:26:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:33,914 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 381 transitions. [2024-11-27 20:26:33,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 381 transitions. [2024-11-27 20:26:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-27 20:26:33,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:33,917 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:33,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:26:33,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2092208509, now seen corresponding path program 1 times [2024-11-27 20:26:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671774318] [2024-11-27 20:26:33,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671774318] [2024-11-27 20:26:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671774318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-27 20:26:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046364387] [2024-11-27 20:26:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 20:26:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:35,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 20:26:35,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:26:35,447 INFO L87 Difference]: Start difference. First operand 272 states and 381 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:36,061 INFO L93 Difference]: Finished difference Result 506 states and 716 transitions. [2024-11-27 20:26:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-27 20:26:36,062 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-27 20:26:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:36,063 INFO L225 Difference]: With dead ends: 506 [2024-11-27 20:26:36,064 INFO L226 Difference]: Without dead ends: 304 [2024-11-27 20:26:36,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-11-27 20:26:36,065 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 18 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:36,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3306 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:26:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-27 20:26:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2024-11-27 20:26:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4054054054054055) internal successors, (416), 296 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2024-11-27 20:26:36,075 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 87 [2024-11-27 20:26:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:36,077 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2024-11-27 20:26:36,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2024-11-27 20:26:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-27 20:26:36,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:36,079 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:36,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:26:36,079 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:36,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1718960163, now seen corresponding path program 1 times [2024-11-27 20:26:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119448148] [2024-11-27 20:26:36,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:37,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119448148] [2024-11-27 20:26:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119448148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:37,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:37,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079191613] [2024-11-27 20:26:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:37,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:37,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:37,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:37,034 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:37,145 INFO L93 Difference]: Finished difference Result 530 states and 751 transitions. [2024-11-27 20:26:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-27 20:26:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:37,147 INFO L225 Difference]: With dead ends: 530 [2024-11-27 20:26:37,147 INFO L226 Difference]: Without dead ends: 310 [2024-11-27 20:26:37,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:37,148 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:37,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1269 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-27 20:26:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2024-11-27 20:26:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4026402640264026) internal successors, (425), 303 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 425 transitions. [2024-11-27 20:26:37,157 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 425 transitions. Word has length 87 [2024-11-27 20:26:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 425 transitions. [2024-11-27 20:26:37,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 425 transitions. [2024-11-27 20:26:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-27 20:26:37,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:37,159 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:26:37,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash 705563346, now seen corresponding path program 1 times [2024-11-27 20:26:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648554536] [2024-11-27 20:26:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:37,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:37,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648554536] [2024-11-27 20:26:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648554536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997090926] [2024-11-27 20:26:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:37,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:37,993 INFO L87 Difference]: Start difference. First operand 304 states and 425 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:38,109 INFO L93 Difference]: Finished difference Result 638 states and 901 transitions. [2024-11-27 20:26:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-27 20:26:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:38,112 INFO L225 Difference]: With dead ends: 638 [2024-11-27 20:26:38,112 INFO L226 Difference]: Without dead ends: 364 [2024-11-27 20:26:38,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:26:38,113 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 510 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:38,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 615 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-27 20:26:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 289. [2024-11-27 20:26:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.3993055555555556) internal successors, (403), 288 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2024-11-27 20:26:38,123 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 87 [2024-11-27 20:26:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:38,123 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2024-11-27 20:26:38,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2024-11-27 20:26:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-27 20:26:38,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:38,125 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:38,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:26:38,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:38,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484754, now seen corresponding path program 1 times [2024-11-27 20:26:38,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:38,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154129151] [2024-11-27 20:26:38,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:38,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154129151] [2024-11-27 20:26:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154129151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:26:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836618424] [2024-11-27 20:26:38,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:26:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:38,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:26:38,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:38,820 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:38,846 INFO L93 Difference]: Finished difference Result 528 states and 743 transitions. [2024-11-27 20:26:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:26:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-27 20:26:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:38,848 INFO L225 Difference]: With dead ends: 528 [2024-11-27 20:26:38,848 INFO L226 Difference]: Without dead ends: 274 [2024-11-27 20:26:38,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:38,849 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:38,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-27 20:26:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-27 20:26:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.3919413919413919) internal successors, (380), 273 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 380 transitions. [2024-11-27 20:26:38,861 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 380 transitions. Word has length 88 [2024-11-27 20:26:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 380 transitions. [2024-11-27 20:26:38,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 380 transitions. [2024-11-27 20:26:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-27 20:26:38,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:38,862 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:26:38,863 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:38,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1543255204, now seen corresponding path program 1 times [2024-11-27 20:26:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:38,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793566130] [2024-11-27 20:26:38,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:39,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:39,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793566130] [2024-11-27 20:26:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793566130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:39,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:39,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472293678] [2024-11-27 20:26:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:39,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:39,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:39,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:39,940 INFO L87 Difference]: Start difference. First operand 274 states and 380 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:40,246 INFO L93 Difference]: Finished difference Result 598 states and 844 transitions. [2024-11-27 20:26:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:40,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-27 20:26:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:40,251 INFO L225 Difference]: With dead ends: 598 [2024-11-27 20:26:40,251 INFO L226 Difference]: Without dead ends: 387 [2024-11-27 20:26:40,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:40,255 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 523 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1350 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-27 20:26:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 287. [2024-11-27 20:26:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 286 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 398 transitions. [2024-11-27 20:26:40,266 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 398 transitions. Word has length 88 [2024-11-27 20:26:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 398 transitions. [2024-11-27 20:26:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 398 transitions. [2024-11-27 20:26:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-27 20:26:40,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:40,268 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:40,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:26:40,268 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:40,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -203272487, now seen corresponding path program 1 times [2024-11-27 20:26:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:40,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572305947] [2024-11-27 20:26:40,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:40,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572305947] [2024-11-27 20:26:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572305947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:41,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-27 20:26:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787368090] [2024-11-27 20:26:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:41,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:26:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:41,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:26:41,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-27 20:26:41,861 INFO L87 Difference]: Start difference. First operand 287 states and 398 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:42,562 INFO L93 Difference]: Finished difference Result 546 states and 767 transitions. [2024-11-27 20:26:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-27 20:26:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-27 20:26:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:42,565 INFO L225 Difference]: With dead ends: 546 [2024-11-27 20:26:42,565 INFO L226 Difference]: Without dead ends: 322 [2024-11-27 20:26:42,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-27 20:26:42,567 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 19 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:42,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3439 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:26:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-27 20:26:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-11-27 20:26:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.3887147335423198) internal successors, (443), 319 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 443 transitions. [2024-11-27 20:26:42,579 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 443 transitions. Word has length 88 [2024-11-27 20:26:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:42,580 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 443 transitions. [2024-11-27 20:26:42,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 443 transitions. [2024-11-27 20:26:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-27 20:26:42,581 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:42,581 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:26:42,582 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:42,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash 885959993, now seen corresponding path program 1 times [2024-11-27 20:26:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233012232] [2024-11-27 20:26:42,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233012232] [2024-11-27 20:26:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233012232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419985427] [2024-11-27 20:26:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:43,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:43,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:43,408 INFO L87 Difference]: Start difference. First operand 320 states and 443 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:43,536 INFO L93 Difference]: Finished difference Result 588 states and 824 transitions. [2024-11-27 20:26:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-27 20:26:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:43,538 INFO L225 Difference]: With dead ends: 588 [2024-11-27 20:26:43,539 INFO L226 Difference]: Without dead ends: 335 [2024-11-27 20:26:43,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:43,540 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 3 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:43,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1257 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-27 20:26:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2024-11-27 20:26:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.3848484848484848) internal successors, (457), 330 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 457 transitions. [2024-11-27 20:26:43,550 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 457 transitions. Word has length 88 [2024-11-27 20:26:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 457 transitions. [2024-11-27 20:26:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 457 transitions. [2024-11-27 20:26:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-27 20:26:43,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:43,553 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:43,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 20:26:43,553 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -429758453, now seen corresponding path program 1 times [2024-11-27 20:26:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476164846] [2024-11-27 20:26:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476164846] [2024-11-27 20:26:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476164846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:45,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:45,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-27 20:26:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730924150] [2024-11-27 20:26:45,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:45,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 20:26:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:45,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 20:26:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2024-11-27 20:26:45,488 INFO L87 Difference]: Start difference. First operand 331 states and 457 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:46,442 INFO L93 Difference]: Finished difference Result 618 states and 862 transitions. [2024-11-27 20:26:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-27 20:26:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-27 20:26:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:46,444 INFO L225 Difference]: With dead ends: 618 [2024-11-27 20:26:46,444 INFO L226 Difference]: Without dead ends: 369 [2024-11-27 20:26:46,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2024-11-27 20:26:46,446 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 26 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:46,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4182 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:26:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-27 20:26:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2024-11-27 20:26:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.384401114206128) internal successors, (497), 359 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 497 transitions. [2024-11-27 20:26:46,456 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 497 transitions. Word has length 89 [2024-11-27 20:26:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 497 transitions. [2024-11-27 20:26:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 497 transitions. [2024-11-27 20:26:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-27 20:26:46,458 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:46,458 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 20:26:46,458 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -581637290, now seen corresponding path program 1 times [2024-11-27 20:26:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114630127] [2024-11-27 20:26:46,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114630127] [2024-11-27 20:26:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114630127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:47,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629985264] [2024-11-27 20:26:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:47,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:47,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:47,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:47,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:47,463 INFO L87 Difference]: Start difference. First operand 360 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:47,695 INFO L93 Difference]: Finished difference Result 736 states and 1032 transitions. [2024-11-27 20:26:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-27 20:26:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:47,697 INFO L225 Difference]: With dead ends: 736 [2024-11-27 20:26:47,697 INFO L226 Difference]: Without dead ends: 465 [2024-11-27 20:26:47,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:47,699 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 514 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:47,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1349 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-27 20:26:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 373. [2024-11-27 20:26:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3844086021505377) internal successors, (515), 372 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 515 transitions. [2024-11-27 20:26:47,711 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 515 transitions. Word has length 89 [2024-11-27 20:26:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 515 transitions. [2024-11-27 20:26:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 515 transitions. [2024-11-27 20:26:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-27 20:26:47,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:47,712 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:47,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 20:26:47,714 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:47,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1375930773, now seen corresponding path program 1 times [2024-11-27 20:26:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:47,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248961307] [2024-11-27 20:26:47,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248961307] [2024-11-27 20:26:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248961307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:48,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:26:48,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445899712] [2024-11-27 20:26:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:26:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:48,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:26:48,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:48,372 INFO L87 Difference]: Start difference. First operand 373 states and 515 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:48,388 INFO L93 Difference]: Finished difference Result 664 states and 927 transitions. [2024-11-27 20:26:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:26:48,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-27 20:26:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:48,390 INFO L225 Difference]: With dead ends: 664 [2024-11-27 20:26:48,390 INFO L226 Difference]: Without dead ends: 370 [2024-11-27 20:26:48,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:26:48,391 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:48,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:26:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-27 20:26:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-27 20:26:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.3766937669376693) internal successors, (508), 369 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 508 transitions. [2024-11-27 20:26:48,405 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 508 transitions. Word has length 89 [2024-11-27 20:26:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:48,405 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 508 transitions. [2024-11-27 20:26:48,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 508 transitions. [2024-11-27 20:26:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-27 20:26:48,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:48,406 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:48,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 20:26:48,407 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:48,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash 444663392, now seen corresponding path program 1 times [2024-11-27 20:26:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853635152] [2024-11-27 20:26:48,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853635152] [2024-11-27 20:26:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853635152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733833659] [2024-11-27 20:26:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:49,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:49,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:49,185 INFO L87 Difference]: Start difference. First operand 370 states and 508 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:49,286 INFO L93 Difference]: Finished difference Result 769 states and 1068 transitions. [2024-11-27 20:26:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-27 20:26:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:49,288 INFO L225 Difference]: With dead ends: 769 [2024-11-27 20:26:49,288 INFO L226 Difference]: Without dead ends: 439 [2024-11-27 20:26:49,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:26:49,289 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 510 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:49,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 602 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-27 20:26:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 350. [2024-11-27 20:26:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.3782234957020056) internal successors, (481), 349 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 481 transitions. [2024-11-27 20:26:49,302 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 481 transitions. Word has length 89 [2024-11-27 20:26:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:49,303 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 481 transitions. [2024-11-27 20:26:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 481 transitions. [2024-11-27 20:26:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:26:49,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:49,304 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:49,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 20:26:49,304 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1332922382, now seen corresponding path program 1 times [2024-11-27 20:26:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283699811] [2024-11-27 20:26:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283699811] [2024-11-27 20:26:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283699811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944906791] [2024-11-27 20:26:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:50,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:50,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:50,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:50,702 INFO L87 Difference]: Start difference. First operand 350 states and 481 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:50,971 INFO L93 Difference]: Finished difference Result 717 states and 1002 transitions. [2024-11-27 20:26:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-27 20:26:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:50,973 INFO L225 Difference]: With dead ends: 717 [2024-11-27 20:26:50,973 INFO L226 Difference]: Without dead ends: 447 [2024-11-27 20:26:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:50,974 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 485 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:50,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1332 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-27 20:26:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 362. [2024-11-27 20:26:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.3795013850415512) internal successors, (498), 361 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 498 transitions. [2024-11-27 20:26:50,984 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 498 transitions. Word has length 90 [2024-11-27 20:26:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:50,985 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 498 transitions. [2024-11-27 20:26:50,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 498 transitions. [2024-11-27 20:26:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:26:50,986 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:50,986 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 20:26:50,986 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 920082215, now seen corresponding path program 1 times [2024-11-27 20:26:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912565472] [2024-11-27 20:26:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912565472] [2024-11-27 20:26:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912565472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-27 20:26:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241214236] [2024-11-27 20:26:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:52,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-27 20:26:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-27 20:26:52,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:26:52,715 INFO L87 Difference]: Start difference. First operand 362 states and 498 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:53,709 INFO L93 Difference]: Finished difference Result 671 states and 937 transitions. [2024-11-27 20:26:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-27 20:26:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-27 20:26:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:53,711 INFO L225 Difference]: With dead ends: 671 [2024-11-27 20:26:53,711 INFO L226 Difference]: Without dead ends: 389 [2024-11-27 20:26:53,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-27 20:26:53,713 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 27 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:53,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4127 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-27 20:26:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-27 20:26:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2024-11-27 20:26:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.3808290155440415) internal successors, (533), 386 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 533 transitions. [2024-11-27 20:26:53,722 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 533 transitions. Word has length 90 [2024-11-27 20:26:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 533 transitions. [2024-11-27 20:26:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 533 transitions. [2024-11-27 20:26:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:26:53,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:53,723 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:53,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 20:26:53,724 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash -206039673, now seen corresponding path program 1 times [2024-11-27 20:26:53,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:53,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582265214] [2024-11-27 20:26:53,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582265214] [2024-11-27 20:26:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582265214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35163588] [2024-11-27 20:26:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:54,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:54,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:54,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:54,455 INFO L87 Difference]: Start difference. First operand 387 states and 533 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:54,551 INFO L93 Difference]: Finished difference Result 705 states and 984 transitions. [2024-11-27 20:26:54,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:54,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-27 20:26:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:54,553 INFO L225 Difference]: With dead ends: 705 [2024-11-27 20:26:54,553 INFO L226 Difference]: Without dead ends: 402 [2024-11-27 20:26:54,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:54,554 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 3 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:54,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1452 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-27 20:26:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2024-11-27 20:26:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 397 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 547 transitions. [2024-11-27 20:26:54,563 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 547 transitions. Word has length 90 [2024-11-27 20:26:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:54,563 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 547 transitions. [2024-11-27 20:26:54,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 547 transitions. [2024-11-27 20:26:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:26:54,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:54,565 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:54,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 20:26:54,565 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -62625796, now seen corresponding path program 1 times [2024-11-27 20:26:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036864331] [2024-11-27 20:26:54,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:55,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036864331] [2024-11-27 20:26:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036864331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:55,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:55,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:26:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248885029] [2024-11-27 20:26:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:55,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:26:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:55,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:26:55,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:26:55,144 INFO L87 Difference]: Start difference. First operand 398 states and 547 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:55,239 INFO L93 Difference]: Finished difference Result 811 states and 1126 transitions. [2024-11-27 20:26:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:26:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-27 20:26:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:55,241 INFO L225 Difference]: With dead ends: 811 [2024-11-27 20:26:55,241 INFO L226 Difference]: Without dead ends: 458 [2024-11-27 20:26:55,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:26:55,242 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 476 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:55,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 602 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-27 20:26:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 377. [2024-11-27 20:26:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.375) internal successors, (517), 376 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 517 transitions. [2024-11-27 20:26:55,257 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 517 transitions. Word has length 90 [2024-11-27 20:26:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:55,258 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 517 transitions. [2024-11-27 20:26:55,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 517 transitions. [2024-11-27 20:26:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 20:26:55,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:55,259 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:55,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 20:26:55,260 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:55,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:55,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1289395484, now seen corresponding path program 1 times [2024-11-27 20:26:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:55,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635050341] [2024-11-27 20:26:55,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:55,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635050341] [2024-11-27 20:26:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635050341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:55,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:26:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90329515] [2024-11-27 20:26:55,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:55,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:26:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:55,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:26:55,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:26:55,963 INFO L87 Difference]: Start difference. First operand 377 states and 517 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:56,212 INFO L93 Difference]: Finished difference Result 766 states and 1068 transitions. [2024-11-27 20:26:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:26:56,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-27 20:26:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:56,214 INFO L225 Difference]: With dead ends: 766 [2024-11-27 20:26:56,215 INFO L226 Difference]: Without dead ends: 466 [2024-11-27 20:26:56,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:26:56,215 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 451 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:56,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1208 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:26:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-27 20:26:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 390. [2024-11-27 20:26:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.3753213367609254) internal successors, (535), 389 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 535 transitions. [2024-11-27 20:26:56,225 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 535 transitions. Word has length 91 [2024-11-27 20:26:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:56,226 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 535 transitions. [2024-11-27 20:26:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 535 transitions. [2024-11-27 20:26:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 20:26:56,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:56,227 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-27 20:26:56,227 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:56,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -871652867, now seen corresponding path program 1 times [2024-11-27 20:26:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391364314] [2024-11-27 20:26:56,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:56,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391364314] [2024-11-27 20:26:56,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391364314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:56,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:56,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:26:56,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704254860] [2024-11-27 20:26:56,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:56,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:26:56,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:56,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:26:56,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:56,822 INFO L87 Difference]: Start difference. First operand 390 states and 535 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:56,914 INFO L93 Difference]: Finished difference Result 703 states and 979 transitions. [2024-11-27 20:26:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:26:56,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-27 20:26:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:56,916 INFO L225 Difference]: With dead ends: 703 [2024-11-27 20:26:56,916 INFO L226 Difference]: Without dead ends: 403 [2024-11-27 20:26:56,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:26:56,917 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:56,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1467 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:26:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-27 20:26:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2024-11-27 20:26:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3772151898734177) internal successors, (544), 395 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 544 transitions. [2024-11-27 20:26:56,926 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 544 transitions. Word has length 91 [2024-11-27 20:26:56,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:56,926 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 544 transitions. [2024-11-27 20:26:56,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 544 transitions. [2024-11-27 20:26:56,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 20:26:56,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:56,928 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:56,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 20:26:56,928 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:56,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:56,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1621007207, now seen corresponding path program 1 times [2024-11-27 20:26:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544112592] [2024-11-27 20:26:56,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:26:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:26:58,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:26:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544112592] [2024-11-27 20:26:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544112592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:26:58,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:26:58,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-27 20:26:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326345530] [2024-11-27 20:26:58,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:26:58,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-27 20:26:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:26:58,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-27 20:26:58,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2024-11-27 20:26:58,513 INFO L87 Difference]: Start difference. First operand 396 states and 544 transitions. Second operand has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:26:59,435 INFO L93 Difference]: Finished difference Result 734 states and 1023 transitions. [2024-11-27 20:26:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-27 20:26:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-27 20:26:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:26:59,436 INFO L225 Difference]: With dead ends: 734 [2024-11-27 20:26:59,437 INFO L226 Difference]: Without dead ends: 416 [2024-11-27 20:26:59,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2024-11-27 20:26:59,438 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 32 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:26:59,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4272 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:26:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-27 20:26:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-27 20:26:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.3777239709443099) internal successors, (569), 413 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 569 transitions. [2024-11-27 20:26:59,452 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 569 transitions. Word has length 91 [2024-11-27 20:26:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:26:59,452 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 569 transitions. [2024-11-27 20:26:59,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:26:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 569 transitions. [2024-11-27 20:26:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-27 20:26:59,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:26:59,453 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:26:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 20:26:59,453 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:26:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:26:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -870296839, now seen corresponding path program 1 times [2024-11-27 20:26:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:26:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168851605] [2024-11-27 20:26:59,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:26:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:26:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:00,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:00,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168851605] [2024-11-27 20:27:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168851605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:27:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784668937] [2024-11-27 20:27:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:27:00,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:00,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:27:00,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:00,242 INFO L87 Difference]: Start difference. First operand 414 states and 569 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:00,356 INFO L93 Difference]: Finished difference Result 761 states and 1060 transitions. [2024-11-27 20:27:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:27:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-27 20:27:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:00,358 INFO L225 Difference]: With dead ends: 761 [2024-11-27 20:27:00,358 INFO L226 Difference]: Without dead ends: 429 [2024-11-27 20:27:00,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:00,359 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 3 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:00,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1452 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-27 20:27:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2024-11-27 20:27:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.375) internal successors, (583), 424 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:00,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 583 transitions. [2024-11-27 20:27:00,367 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 583 transitions. Word has length 91 [2024-11-27 20:27:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:00,368 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 583 transitions. [2024-11-27 20:27:00,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 583 transitions. [2024-11-27 20:27:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:27:00,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:00,369 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:00,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 20:27:00,369 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:00,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash -795233984, now seen corresponding path program 1 times [2024-11-27 20:27:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44078527] [2024-11-27 20:27:00,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:00,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:01,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:01,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44078527] [2024-11-27 20:27:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44078527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:01,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:01,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600900427] [2024-11-27 20:27:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:01,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:01,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:01,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:01,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:01,212 INFO L87 Difference]: Start difference. First operand 425 states and 583 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:01,447 INFO L93 Difference]: Finished difference Result 834 states and 1161 transitions. [2024-11-27 20:27:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:27:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-27 20:27:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:01,449 INFO L225 Difference]: With dead ends: 834 [2024-11-27 20:27:01,449 INFO L226 Difference]: Without dead ends: 506 [2024-11-27 20:27:01,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:27:01,450 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 439 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:01,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1335 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:27:01,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-27 20:27:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 438. [2024-11-27 20:27:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.3752860411899313) internal successors, (601), 437 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 601 transitions. [2024-11-27 20:27:01,459 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 601 transitions. Word has length 92 [2024-11-27 20:27:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:01,460 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 601 transitions. [2024-11-27 20:27:01,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 601 transitions. [2024-11-27 20:27:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:27:01,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:01,461 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:01,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-27 20:27:01,461 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash 941413749, now seen corresponding path program 1 times [2024-11-27 20:27:01,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:01,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863392427] [2024-11-27 20:27:01,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:01,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863392427] [2024-11-27 20:27:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863392427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2024-11-27 20:27:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615600876] [2024-11-27 20:27:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:03,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-27 20:27:03,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:03,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-27 20:27:03,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2024-11-27 20:27:03,249 INFO L87 Difference]: Start difference. First operand 438 states and 601 transitions. Second operand has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:04,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:04,633 INFO L93 Difference]: Finished difference Result 831 states and 1154 transitions. [2024-11-27 20:27:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-27 20:27:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-27 20:27:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:04,635 INFO L225 Difference]: With dead ends: 831 [2024-11-27 20:27:04,635 INFO L226 Difference]: Without dead ends: 490 [2024-11-27 20:27:04,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=1054, Unknown=0, NotChecked=0, Total=1122 [2024-11-27 20:27:04,636 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 39 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:04,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5726 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:27:04,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-27 20:27:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2024-11-27 20:27:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.3773584905660377) internal successors, (657), 477 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 657 transitions. [2024-11-27 20:27:04,645 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 657 transitions. Word has length 92 [2024-11-27 20:27:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:04,645 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 657 transitions. [2024-11-27 20:27:04,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 657 transitions. [2024-11-27 20:27:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:27:04,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:04,646 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:04,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-27 20:27:04,646 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:04,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1532097493, now seen corresponding path program 1 times [2024-11-27 20:27:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101231621] [2024-11-27 20:27:04,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101231621] [2024-11-27 20:27:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101231621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:27:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704783970] [2024-11-27 20:27:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:05,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:27:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:05,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:27:05,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:05,285 INFO L87 Difference]: Start difference. First operand 478 states and 657 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:05,377 INFO L93 Difference]: Finished difference Result 861 states and 1198 transitions. [2024-11-27 20:27:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:27:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-27 20:27:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:05,379 INFO L225 Difference]: With dead ends: 861 [2024-11-27 20:27:05,379 INFO L226 Difference]: Without dead ends: 488 [2024-11-27 20:27:05,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:05,380 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:05,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1460 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-27 20:27:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2024-11-27 20:27:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.3757828810020878) internal successors, (659), 479 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 659 transitions. [2024-11-27 20:27:05,387 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 659 transitions. Word has length 92 [2024-11-27 20:27:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:05,388 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 659 transitions. [2024-11-27 20:27:05,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 659 transitions. [2024-11-27 20:27:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-27 20:27:05,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:05,389 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:05,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-27 20:27:05,389 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:05,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash -820081846, now seen corresponding path program 1 times [2024-11-27 20:27:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835872129] [2024-11-27 20:27:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835872129] [2024-11-27 20:27:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835872129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:05,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:05,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:05,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874256666] [2024-11-27 20:27:05,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:05,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:05,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:05,900 INFO L87 Difference]: Start difference. First operand 480 states and 659 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:05,915 INFO L93 Difference]: Finished difference Result 876 states and 1218 transitions. [2024-11-27 20:27:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-27 20:27:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:05,918 INFO L225 Difference]: With dead ends: 876 [2024-11-27 20:27:05,918 INFO L226 Difference]: Without dead ends: 451 [2024-11-27 20:27:05,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:05,919 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:05,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:27:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-27 20:27:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2024-11-27 20:27:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3716216216216217) internal successors, (609), 444 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 609 transitions. [2024-11-27 20:27:05,929 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 609 transitions. Word has length 92 [2024-11-27 20:27:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:05,929 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 609 transitions. [2024-11-27 20:27:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 609 transitions. [2024-11-27 20:27:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:27:05,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:05,930 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:05,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-27 20:27:05,931 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:05,931 INFO L85 PathProgramCache]: Analyzing trace with hash 732561522, now seen corresponding path program 1 times [2024-11-27 20:27:05,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:05,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862656002] [2024-11-27 20:27:05,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:05,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:07,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862656002] [2024-11-27 20:27:07,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862656002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:07,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:07,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:07,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401930047] [2024-11-27 20:27:07,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:07,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:07,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:07,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:07,103 INFO L87 Difference]: Start difference. First operand 445 states and 609 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:07,330 INFO L93 Difference]: Finished difference Result 833 states and 1159 transitions. [2024-11-27 20:27:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:27:07,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-27 20:27:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:07,331 INFO L225 Difference]: With dead ends: 833 [2024-11-27 20:27:07,331 INFO L226 Difference]: Without dead ends: 488 [2024-11-27 20:27:07,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:27:07,332 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 361 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:07,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1222 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:27:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-27 20:27:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 458. [2024-11-27 20:27:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.37417943107221) internal successors, (628), 457 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 628 transitions. [2024-11-27 20:27:07,338 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 628 transitions. Word has length 93 [2024-11-27 20:27:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 628 transitions. [2024-11-27 20:27:07,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 628 transitions. [2024-11-27 20:27:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:27:07,339 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:07,339 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:07,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-27 20:27:07,340 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1603696857, now seen corresponding path program 1 times [2024-11-27 20:27:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335214895] [2024-11-27 20:27:07,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335214895] [2024-11-27 20:27:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335214895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2024-11-27 20:27:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625224528] [2024-11-27 20:27:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-27 20:27:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:09,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-27 20:27:09,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-27 20:27:09,159 INFO L87 Difference]: Start difference. First operand 458 states and 628 transitions. Second operand has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:10,531 INFO L93 Difference]: Finished difference Result 850 states and 1184 transitions. [2024-11-27 20:27:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-27 20:27:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-27 20:27:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:10,532 INFO L225 Difference]: With dead ends: 850 [2024-11-27 20:27:10,532 INFO L226 Difference]: Without dead ends: 492 [2024-11-27 20:27:10,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-27 20:27:10,533 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 40 mSDsluCounter, 4550 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:10,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4694 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-27 20:27:10,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-27 20:27:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2024-11-27 20:27:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.3762781186094069) internal successors, (673), 489 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 673 transitions. [2024-11-27 20:27:10,541 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 673 transitions. Word has length 93 [2024-11-27 20:27:10,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:10,541 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 673 transitions. [2024-11-27 20:27:10,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:10,542 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 673 transitions. [2024-11-27 20:27:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:27:10,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:10,542 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:10,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-27 20:27:10,543 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1286395271, now seen corresponding path program 1 times [2024-11-27 20:27:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82492314] [2024-11-27 20:27:10,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:11,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:11,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82492314] [2024-11-27 20:27:11,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82492314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:11,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:11,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:27:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459420145] [2024-11-27 20:27:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:11,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:27:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:11,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:27:11,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:11,126 INFO L87 Difference]: Start difference. First operand 490 states and 673 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:11,208 INFO L93 Difference]: Finished difference Result 891 states and 1241 transitions. [2024-11-27 20:27:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:27:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-27 20:27:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:11,210 INFO L225 Difference]: With dead ends: 891 [2024-11-27 20:27:11,210 INFO L226 Difference]: Without dead ends: 505 [2024-11-27 20:27:11,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:27:11,211 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 3 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:11,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1233 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-27 20:27:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2024-11-27 20:27:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.374) internal successors, (687), 500 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 687 transitions. [2024-11-27 20:27:11,219 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 687 transitions. Word has length 93 [2024-11-27 20:27:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:11,219 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 687 transitions. [2024-11-27 20:27:11,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 687 transitions. [2024-11-27 20:27:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:27:11,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:11,220 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:11,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-27 20:27:11,220 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:11,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1839786176, now seen corresponding path program 1 times [2024-11-27 20:27:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:11,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756465009] [2024-11-27 20:27:11,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:11,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756465009] [2024-11-27 20:27:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756465009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:27:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132550163] [2024-11-27 20:27:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:27:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:11,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:27:11,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:27:11,754 INFO L87 Difference]: Start difference. First operand 501 states and 687 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:11,847 INFO L93 Difference]: Finished difference Result 980 states and 1360 transitions. [2024-11-27 20:27:11,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:27:11,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-27 20:27:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:11,849 INFO L225 Difference]: With dead ends: 980 [2024-11-27 20:27:11,850 INFO L226 Difference]: Without dead ends: 552 [2024-11-27 20:27:11,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:27:11,851 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 412 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:11,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 596 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-27 20:27:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 495. [2024-11-27 20:27:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.3704453441295548) internal successors, (677), 494 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 677 transitions. [2024-11-27 20:27:11,861 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 677 transitions. Word has length 93 [2024-11-27 20:27:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 677 transitions. [2024-11-27 20:27:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 677 transitions. [2024-11-27 20:27:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-27 20:27:11,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:11,862 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:11,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-27 20:27:11,863 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 150040444, now seen corresponding path program 1 times [2024-11-27 20:27:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130874417] [2024-11-27 20:27:11,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130874417] [2024-11-27 20:27:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130874417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737276893] [2024-11-27 20:27:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:12,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:12,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:12,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:12,404 INFO L87 Difference]: Start difference. First operand 495 states and 677 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:12,421 INFO L93 Difference]: Finished difference Result 899 states and 1247 transitions. [2024-11-27 20:27:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:12,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-27 20:27:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:12,422 INFO L225 Difference]: With dead ends: 899 [2024-11-27 20:27:12,422 INFO L226 Difference]: Without dead ends: 464 [2024-11-27 20:27:12,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:12,423 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:12,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:27:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-27 20:27:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2024-11-27 20:27:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3676148796498906) internal successors, (625), 457 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 625 transitions. [2024-11-27 20:27:12,428 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 625 transitions. Word has length 93 [2024-11-27 20:27:12,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:12,428 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 625 transitions. [2024-11-27 20:27:12,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 625 transitions. [2024-11-27 20:27:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:27:12,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:12,429 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:12,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-27 20:27:12,429 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:12,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1300215773, now seen corresponding path program 1 times [2024-11-27 20:27:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269316289] [2024-11-27 20:27:12,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269316289] [2024-11-27 20:27:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269316289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418105694] [2024-11-27 20:27:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:12,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:12,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:12,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:12,928 INFO L87 Difference]: Start difference. First operand 458 states and 625 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:12,943 INFO L93 Difference]: Finished difference Result 830 states and 1151 transitions. [2024-11-27 20:27:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-27 20:27:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:12,944 INFO L225 Difference]: With dead ends: 830 [2024-11-27 20:27:12,944 INFO L226 Difference]: Without dead ends: 455 [2024-11-27 20:27:12,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:12,945 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:12,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 630 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:27:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-27 20:27:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-27 20:27:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.3634361233480177) internal successors, (619), 454 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 619 transitions. [2024-11-27 20:27:12,951 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 619 transitions. Word has length 94 [2024-11-27 20:27:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:12,951 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 619 transitions. [2024-11-27 20:27:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 619 transitions. [2024-11-27 20:27:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:27:12,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:12,952 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:12,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-27 20:27:12,952 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:12,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash -33185650, now seen corresponding path program 1 times [2024-11-27 20:27:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172420229] [2024-11-27 20:27:12,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:12,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172420229] [2024-11-27 20:27:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172420229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78430834] [2024-11-27 20:27:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:13,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:13,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:13,617 INFO L87 Difference]: Start difference. First operand 455 states and 619 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:13,812 INFO L93 Difference]: Finished difference Result 854 states and 1183 transitions. [2024-11-27 20:27:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:27:13,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-27 20:27:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:13,814 INFO L225 Difference]: With dead ends: 854 [2024-11-27 20:27:13,814 INFO L226 Difference]: Without dead ends: 490 [2024-11-27 20:27:13,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:27:13,815 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 313 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:13,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1186 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-27 20:27:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 468. [2024-11-27 20:27:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.3640256959314776) internal successors, (637), 467 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 637 transitions. [2024-11-27 20:27:13,821 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 637 transitions. Word has length 94 [2024-11-27 20:27:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 637 transitions. [2024-11-27 20:27:13,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 637 transitions. [2024-11-27 20:27:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-27 20:27:13,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:13,823 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:13,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-27 20:27:13,823 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -560543293, now seen corresponding path program 1 times [2024-11-27 20:27:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014381345] [2024-11-27 20:27:13,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014381345] [2024-11-27 20:27:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014381345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:27:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370058300] [2024-11-27 20:27:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:14,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:27:14,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:14,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:27:14,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:27:14,646 INFO L87 Difference]: Start difference. First operand 468 states and 637 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:14,769 INFO L93 Difference]: Finished difference Result 860 states and 1189 transitions. [2024-11-27 20:27:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:27:14,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-27 20:27:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:14,771 INFO L225 Difference]: With dead ends: 860 [2024-11-27 20:27:14,771 INFO L226 Difference]: Without dead ends: 483 [2024-11-27 20:27:14,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:27:14,772 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 5 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:14,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1783 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-27 20:27:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2024-11-27 20:27:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.3617463617463617) internal successors, (655), 481 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 655 transitions. [2024-11-27 20:27:14,780 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 655 transitions. Word has length 94 [2024-11-27 20:27:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:14,780 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 655 transitions. [2024-11-27 20:27:14,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 655 transitions. [2024-11-27 20:27:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 20:27:14,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:14,782 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:14,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-27 20:27:14,782 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:14,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1910848512, now seen corresponding path program 1 times [2024-11-27 20:27:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426724141] [2024-11-27 20:27:14,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426724141] [2024-11-27 20:27:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426724141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094308958] [2024-11-27 20:27:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:15,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:15,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:15,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:15,476 INFO L87 Difference]: Start difference. First operand 482 states and 655 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:15,673 INFO L93 Difference]: Finished difference Result 882 states and 1220 transitions. [2024-11-27 20:27:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:27:15,673 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-27 20:27:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:15,675 INFO L225 Difference]: With dead ends: 882 [2024-11-27 20:27:15,675 INFO L226 Difference]: Without dead ends: 509 [2024-11-27 20:27:15,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:27:15,676 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 303 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:15,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1187 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-27 20:27:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 495. [2024-11-27 20:27:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.3623481781376519) internal successors, (673), 494 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 673 transitions. [2024-11-27 20:27:15,681 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 673 transitions. Word has length 95 [2024-11-27 20:27:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:15,681 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 673 transitions. [2024-11-27 20:27:15,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 673 transitions. [2024-11-27 20:27:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 20:27:15,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:15,682 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-27 20:27:15,682 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash -564163285, now seen corresponding path program 1 times [2024-11-27 20:27:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241791213] [2024-11-27 20:27:15,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:15,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:15,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241791213] [2024-11-27 20:27:15,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241791213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:15,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:15,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783091431] [2024-11-27 20:27:15,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:15,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:15,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:15,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:15,822 INFO L87 Difference]: Start difference. First operand 495 states and 673 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:15,838 INFO L93 Difference]: Finished difference Result 870 states and 1202 transitions. [2024-11-27 20:27:15,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:15,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-27 20:27:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:15,839 INFO L225 Difference]: With dead ends: 870 [2024-11-27 20:27:15,839 INFO L226 Difference]: Without dead ends: 497 [2024-11-27 20:27:15,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:15,840 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:15,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:27:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-27 20:27:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2024-11-27 20:27:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.3608870967741935) internal successors, (675), 496 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 675 transitions. [2024-11-27 20:27:15,844 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 675 transitions. Word has length 95 [2024-11-27 20:27:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 675 transitions. [2024-11-27 20:27:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 675 transitions. [2024-11-27 20:27:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 20:27:15,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:15,845 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-27 20:27:15,845 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1437781941, now seen corresponding path program 1 times [2024-11-27 20:27:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251915480] [2024-11-27 20:27:15,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:18,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:18,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:18,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251915480] [2024-11-27 20:27:18,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251915480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-11-27 20:27:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104777997] [2024-11-27 20:27:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:18,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-27 20:27:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-27 20:27:18,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1732, Unknown=0, NotChecked=0, Total=1892 [2024-11-27 20:27:18,832 INFO L87 Difference]: Start difference. First operand 497 states and 675 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:20,446 INFO L93 Difference]: Finished difference Result 947 states and 1304 transitions. [2024-11-27 20:27:20,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-27 20:27:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-27 20:27:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:20,449 INFO L225 Difference]: With dead ends: 947 [2024-11-27 20:27:20,449 INFO L226 Difference]: Without dead ends: 547 [2024-11-27 20:27:20,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=2074, Unknown=0, NotChecked=0, Total=2256 [2024-11-27 20:27:20,450 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 377 mSDsluCounter, 5811 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:20,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 5966 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-27 20:27:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-27 20:27:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 503. [2024-11-27 20:27:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.3585657370517927) internal successors, (682), 502 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 682 transitions. [2024-11-27 20:27:20,456 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 682 transitions. Word has length 95 [2024-11-27 20:27:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 682 transitions. [2024-11-27 20:27:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 682 transitions. [2024-11-27 20:27:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 20:27:20,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:20,457 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:20,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-27 20:27:20,457 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash -169943798, now seen corresponding path program 1 times [2024-11-27 20:27:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107382197] [2024-11-27 20:27:20,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107382197] [2024-11-27 20:27:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107382197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954359976] [2024-11-27 20:27:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:20,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:20,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:20,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:20,887 INFO L87 Difference]: Start difference. First operand 503 states and 682 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:20,904 INFO L93 Difference]: Finished difference Result 893 states and 1229 transitions. [2024-11-27 20:27:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-27 20:27:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:20,905 INFO L225 Difference]: With dead ends: 893 [2024-11-27 20:27:20,905 INFO L226 Difference]: Without dead ends: 465 [2024-11-27 20:27:20,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:20,906 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:20,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:27:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-27 20:27:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 460. [2024-11-27 20:27:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.3529411764705883) internal successors, (621), 459 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 621 transitions. [2024-11-27 20:27:20,910 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 621 transitions. Word has length 95 [2024-11-27 20:27:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:20,910 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 621 transitions. [2024-11-27 20:27:20,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 621 transitions. [2024-11-27 20:27:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:27:20,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:20,911 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:20,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-27 20:27:20,911 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -751499812, now seen corresponding path program 1 times [2024-11-27 20:27:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:20,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728848122] [2024-11-27 20:27:20,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728848122] [2024-11-27 20:27:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728848122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477380700] [2024-11-27 20:27:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:21,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:21,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:21,594 INFO L87 Difference]: Start difference. First operand 460 states and 621 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:21,771 INFO L93 Difference]: Finished difference Result 845 states and 1163 transitions. [2024-11-27 20:27:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:27:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-27 20:27:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:21,773 INFO L225 Difference]: With dead ends: 845 [2024-11-27 20:27:21,773 INFO L226 Difference]: Without dead ends: 479 [2024-11-27 20:27:21,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:27:21,774 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 245 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:21,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1156 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-27 20:27:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2024-11-27 20:27:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.353813559322034) internal successors, (639), 472 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 639 transitions. [2024-11-27 20:27:21,781 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 639 transitions. Word has length 96 [2024-11-27 20:27:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:21,781 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 639 transitions. [2024-11-27 20:27:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 639 transitions. [2024-11-27 20:27:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:27:21,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:21,782 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:21,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-27 20:27:21,783 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:21,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1407158112, now seen corresponding path program 1 times [2024-11-27 20:27:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18786173] [2024-11-27 20:27:21,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:24,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18786173] [2024-11-27 20:27:24,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18786173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:24,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-11-27 20:27:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999310567] [2024-11-27 20:27:24,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:24,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-27 20:27:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:24,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-27 20:27:24,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2024-11-27 20:27:24,485 INFO L87 Difference]: Start difference. First operand 473 states and 639 transitions. Second operand has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:27,578 INFO L93 Difference]: Finished difference Result 892 states and 1232 transitions. [2024-11-27 20:27:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-27 20:27:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-27 20:27:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:27,580 INFO L225 Difference]: With dead ends: 892 [2024-11-27 20:27:27,580 INFO L226 Difference]: Without dead ends: 526 [2024-11-27 20:27:27,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2024-11-27 20:27:27,581 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 336 mSDsluCounter, 4828 mSDsCounter, 0 mSdLazyCounter, 5669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:27,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 4929 Invalid, 5715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 5669 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-27 20:27:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-27 20:27:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2024-11-27 20:27:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.36468330134357) internal successors, (711), 521 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 711 transitions. [2024-11-27 20:27:27,585 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 711 transitions. Word has length 96 [2024-11-27 20:27:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:27,585 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 711 transitions. [2024-11-27 20:27:27,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 711 transitions. [2024-11-27 20:27:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:27:27,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:27,587 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:27,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-27 20:27:27,587 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1772696593, now seen corresponding path program 1 times [2024-11-27 20:27:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354001932] [2024-11-27 20:27:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:29,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354001932] [2024-11-27 20:27:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354001932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-11-27 20:27:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235623514] [2024-11-27 20:27:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:29,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-27 20:27:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:29,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-27 20:27:29,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-27 20:27:29,681 INFO L87 Difference]: Start difference. First operand 522 states and 711 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:31,870 INFO L93 Difference]: Finished difference Result 954 states and 1323 transitions. [2024-11-27 20:27:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-27 20:27:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-27 20:27:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:31,872 INFO L225 Difference]: With dead ends: 954 [2024-11-27 20:27:31,872 INFO L226 Difference]: Without dead ends: 526 [2024-11-27 20:27:31,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-27 20:27:31,872 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 49 mSDsluCounter, 4836 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 4953 SdHoareTripleChecker+Invalid, 4270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:31,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 4953 Invalid, 4270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-27 20:27:31,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-27 20:27:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-11-27 20:27:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.3638095238095238) internal successors, (716), 525 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 716 transitions. [2024-11-27 20:27:31,877 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 716 transitions. Word has length 96 [2024-11-27 20:27:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 716 transitions. [2024-11-27 20:27:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 716 transitions. [2024-11-27 20:27:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-27 20:27:31,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:31,878 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:31,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-27 20:27:31,879 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:31,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1733881231, now seen corresponding path program 1 times [2024-11-27 20:27:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015536707] [2024-11-27 20:27:31,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:32,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:32,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015536707] [2024-11-27 20:27:32,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015536707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:32,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:32,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:27:32,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410224783] [2024-11-27 20:27:32,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:32,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:27:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:32,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:27:32,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:32,554 INFO L87 Difference]: Start difference. First operand 526 states and 716 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:32,634 INFO L93 Difference]: Finished difference Result 972 states and 1348 transitions. [2024-11-27 20:27:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:27:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-27 20:27:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:32,635 INFO L225 Difference]: With dead ends: 972 [2024-11-27 20:27:32,635 INFO L226 Difference]: Without dead ends: 542 [2024-11-27 20:27:32,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:27:32,636 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:32,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1197 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-27 20:27:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2024-11-27 20:27:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.361266294227188) internal successors, (731), 537 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 731 transitions. [2024-11-27 20:27:32,644 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 731 transitions. Word has length 96 [2024-11-27 20:27:32,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:32,644 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 731 transitions. [2024-11-27 20:27:32,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:32,644 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 731 transitions. [2024-11-27 20:27:32,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 20:27:32,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:32,645 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:32,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-27 20:27:32,645 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1056259651, now seen corresponding path program 1 times [2024-11-27 20:27:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452970695] [2024-11-27 20:27:32,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:32,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:33,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:27:33,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452970695] [2024-11-27 20:27:33,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452970695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:33,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:33,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:27:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897987564] [2024-11-27 20:27:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:33,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:27:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:27:33,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:27:33,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:27:33,299 INFO L87 Difference]: Start difference. First operand 538 states and 731 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:33,437 INFO L93 Difference]: Finished difference Result 993 states and 1375 transitions. [2024-11-27 20:27:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:27:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-27 20:27:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:33,440 INFO L225 Difference]: With dead ends: 993 [2024-11-27 20:27:33,440 INFO L226 Difference]: Without dead ends: 563 [2024-11-27 20:27:33,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:27:33,441 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 5 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:33,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1738 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-27 20:27:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 557. [2024-11-27 20:27:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.3615107913669064) internal successors, (757), 556 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 757 transitions. [2024-11-27 20:27:33,451 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 757 transitions. Word has length 97 [2024-11-27 20:27:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:33,451 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 757 transitions. [2024-11-27 20:27:33,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 757 transitions. [2024-11-27 20:27:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-27 20:27:33,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:33,452 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:27:33,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-27 20:27:33,453 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:33,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 892317070, now seen corresponding path program 1 times [2024-11-27 20:27:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:27:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485424141] [2024-11-27 20:27:33,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:27:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:27:33,723 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:27:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:27:33,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:27:33,980 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:27:33,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:27:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-27 20:27:33,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:34,071 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:27:34,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:27:34 BoogieIcfgContainer [2024-11-27 20:27:34,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:27:34,079 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:27:34,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:27:34,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:27:34,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:26:07" (3/4) ... [2024-11-27 20:27:34,082 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:27:34,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:27:34,083 INFO L158 Benchmark]: Toolchain (without parser) took 89107.39ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 92.7MB in the beginning and 854.6MB in the end (delta: -761.9MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,083 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:27:34,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.82ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 74.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.68ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 61.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,085 INFO L158 Benchmark]: Boogie Preprocessor took 186.88ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 53.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,085 INFO L158 Benchmark]: RCFGBuilder took 1625.61ms. Allocated memory is still 117.4MB. Free memory was 53.2MB in the beginning and 75.6MB in the end (delta: -22.5MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,085 INFO L158 Benchmark]: TraceAbstraction took 86693.52ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 74.9MB in the beginning and 854.8MB in the end (delta: -779.9MB). Peak memory consumption was 626.2MB. Max. memory is 16.1GB. [2024-11-27 20:27:34,085 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 1.0GB. Free memory was 854.8MB in the beginning and 854.6MB in the end (delta: 144.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:27:34,086 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.27ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.82ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 74.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.68ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 61.1MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 186.88ms. Allocated memory is still 117.4MB. Free memory was 61.1MB in the beginning and 53.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1625.61ms. Allocated memory is still 117.4MB. Free memory was 53.2MB in the beginning and 75.6MB in the end (delta: -22.5MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * TraceAbstraction took 86693.52ms. Allocated memory was 117.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 74.9MB in the beginning and 854.8MB in the end (delta: -779.9MB). Peak memory consumption was 626.2MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 1.0GB. Free memory was 854.8MB in the beginning and 854.6MB in the end (delta: 144.9kB). 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: 21]: 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 bitwiseAnd at line 248. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_78 = 1; [L35] SORT_1 input_2; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L37] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L38] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L39] SORT_3 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, var_4=0, var_78=1] [L40] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_4; [L45] state_8 = init_9_arg_1 [L46] SORT_3 init_26_arg_1 = var_4; [L47] state_25 = init_26_arg_1 [L48] SORT_3 init_44_arg_1 = var_4; [L49] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L52] input_2 = __VERIFIER_nondet_uchar() [L55] SORT_3 var_7_arg_0 = state_5; [L56] SORT_3 var_7_arg_1 = var_4; [L57] SORT_1 var_7 = var_7_arg_0 != var_7_arg_1; [L58] SORT_3 var_10_arg_0 = state_8; [L59] SORT_3 var_10_arg_1 = var_4; [L60] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L61] SORT_1 var_11_arg_0 = var_7; [L62] SORT_1 var_11_arg_1 = var_10; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11_arg_0=0, var_11_arg_1=1, var_4=0, var_78=1] [L63] EXPR var_11_arg_0 | var_11_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L63] SORT_1 var_11 = var_11_arg_0 | var_11_arg_1; [L64] SORT_3 var_12_arg_0 = state_5; [L65] SORT_3 var_12_arg_1 = var_4; [L66] SORT_1 var_12 = var_12_arg_0 != var_12_arg_1; [L67] SORT_3 var_13_arg_0 = state_8; [L68] SORT_3 var_13_arg_1 = var_4; [L69] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L70] SORT_1 var_14_arg_0 = var_12; [L71] SORT_1 var_14_arg_1 = var_13; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_14_arg_0=0, var_14_arg_1=1, var_4=0, var_78=1] [L72] EXPR var_14_arg_0 | var_14_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_4=0, var_78=1] [L72] SORT_1 var_14 = var_14_arg_0 | var_14_arg_1; [L73] SORT_1 var_15_arg_0 = var_11; [L74] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15_arg_0=1, var_15_arg_1=1, var_4=0, var_78=1] [L75] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L75] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L76] SORT_3 var_16_arg_0 = state_5; [L77] SORT_3 var_16_arg_1 = var_4; [L78] SORT_1 var_16 = var_16_arg_0 != var_16_arg_1; [L79] SORT_3 var_17_arg_0 = state_8; [L80] SORT_3 var_17_arg_1 = var_4; [L81] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L82] SORT_1 var_18_arg_0 = var_16; [L83] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_18_arg_0=0, var_18_arg_1=1, var_4=0, var_78=1] [L84] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_4=0, var_78=1] [L84] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L85] SORT_1 var_19_arg_0 = var_15; [L86] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_78=1] [L87] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L87] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L88] SORT_3 var_20_arg_0 = state_5; [L89] SORT_3 var_20_arg_1 = var_4; [L90] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L91] SORT_3 var_21_arg_0 = state_8; [L92] SORT_3 var_21_arg_1 = var_4; [L93] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L94] SORT_1 var_22_arg_0 = var_20; [L95] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_22_arg_0=0, var_22_arg_1=1, var_4=0, var_78=1] [L96] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_4=0, var_78=1] [L96] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23_arg_0=1, var_23_arg_1=1, var_4=0, var_78=1] [L99] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L99] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L100] SORT_3 var_24_arg_0 = state_8; [L101] SORT_3 var_24_arg_1 = var_4; [L102] SORT_1 var_24 = var_24_arg_0 != var_24_arg_1; [L103] SORT_3 var_27_arg_0 = state_25; [L104] SORT_3 var_27_arg_1 = var_4; [L105] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L106] SORT_1 var_28_arg_0 = var_24; [L107] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_28_arg_0=0, var_28_arg_1=1, var_4=0, var_78=1] [L108] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_4=0, var_78=1] [L108] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L109] SORT_1 var_29_arg_0 = var_23; [L110] SORT_1 var_29_arg_1 = var_28; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29_arg_0=1, var_29_arg_1=1, var_4=0, var_78=1] [L111] EXPR var_29_arg_0 & var_29_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L111] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L112] SORT_3 var_30_arg_0 = state_8; [L113] SORT_3 var_30_arg_1 = var_4; [L114] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L115] SORT_3 var_31_arg_0 = state_25; [L116] SORT_3 var_31_arg_1 = var_4; [L117] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L118] SORT_1 var_32_arg_0 = var_30; [L119] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_32_arg_0=0, var_32_arg_1=1, var_4=0, var_78=1] [L120] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_4=0, var_78=1] [L120] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L121] SORT_1 var_33_arg_0 = var_29; [L122] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33_arg_0=1, var_33_arg_1=1, var_4=0, var_78=1] [L123] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L123] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L124] SORT_3 var_34_arg_0 = state_8; [L125] SORT_3 var_34_arg_1 = var_4; [L126] SORT_1 var_34 = var_34_arg_0 != var_34_arg_1; [L127] SORT_3 var_35_arg_0 = state_25; [L128] SORT_3 var_35_arg_1 = var_4; [L129] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L130] SORT_1 var_36_arg_0 = var_34; [L131] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_36_arg_0=0, var_36_arg_1=1, var_4=0, var_78=1] [L132] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_4=0, var_78=1] [L132] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L133] SORT_1 var_37_arg_0 = var_33; [L134] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37_arg_0=1, var_37_arg_1=1, var_4=0, var_78=1] [L135] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L135] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L136] SORT_3 var_38_arg_0 = state_8; [L137] SORT_3 var_38_arg_1 = var_4; [L138] SORT_1 var_38 = var_38_arg_0 != var_38_arg_1; [L139] SORT_3 var_39_arg_0 = state_25; [L140] SORT_3 var_39_arg_1 = var_4; [L141] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L142] SORT_1 var_40_arg_0 = var_38; [L143] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_40_arg_0=0, var_40_arg_1=1, var_4=0, var_78=1] [L144] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_4=0, var_78=1] [L144] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L145] SORT_1 var_41_arg_0 = var_37; [L146] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41_arg_0=1, var_41_arg_1=1, var_4=0, var_78=1] [L147] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L147] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L148] SORT_3 var_42_arg_0 = state_25; [L149] SORT_3 var_42_arg_1 = var_4; [L150] SORT_1 var_42 = var_42_arg_0 != var_42_arg_1; [L151] SORT_3 var_45_arg_0 = state_43; [L152] SORT_3 var_45_arg_1 = var_4; [L153] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L154] SORT_1 var_46_arg_0 = var_42; [L155] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_46_arg_0=0, var_46_arg_1=1, var_4=0, var_78=1] [L156] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_4=0, var_78=1] [L156] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L157] SORT_1 var_47_arg_0 = var_41; [L158] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47_arg_0=1, var_47_arg_1=1, var_4=0, var_78=1] [L159] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L159] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L160] SORT_3 var_48_arg_0 = state_25; [L161] SORT_3 var_48_arg_1 = var_4; [L162] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L163] SORT_3 var_49_arg_0 = state_43; [L164] SORT_3 var_49_arg_1 = var_4; [L165] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L166] SORT_1 var_50_arg_0 = var_48; [L167] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_50_arg_0=0, var_50_arg_1=1, var_78=1] [L168] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_78=1] [L168] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L169] SORT_1 var_51_arg_0 = var_47; [L170] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51_arg_0=1, var_51_arg_1=1, var_78=1] [L171] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L171] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L172] SORT_3 var_52_arg_0 = state_25; [L173] SORT_3 var_52_arg_1 = var_4; [L174] SORT_1 var_52 = var_52_arg_0 != var_52_arg_1; [L175] SORT_3 var_53_arg_0 = state_43; [L176] SORT_3 var_53_arg_1 = var_4; [L177] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L178] SORT_1 var_54_arg_0 = var_52; [L179] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_54_arg_0=0, var_54_arg_1=1, var_78=1] [L180] EXPR var_54_arg_0 | var_54_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_78=1] [L180] SORT_1 var_54 = var_54_arg_0 | var_54_arg_1; [L181] SORT_1 var_55_arg_0 = var_51; [L182] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55_arg_0=1, var_55_arg_1=1, var_78=1] [L183] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L183] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L184] SORT_3 var_56_arg_0 = state_25; [L185] SORT_3 var_56_arg_1 = var_4; [L186] SORT_1 var_56 = var_56_arg_0 != var_56_arg_1; [L187] SORT_3 var_57_arg_0 = state_43; [L188] SORT_3 var_57_arg_1 = var_4; [L189] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L190] SORT_1 var_58_arg_0 = var_56; [L191] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_58_arg_0=0, var_58_arg_1=1, var_78=1] [L192] EXPR var_58_arg_0 | var_58_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_78=1] [L192] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L193] SORT_1 var_59_arg_0 = var_55; [L194] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59_arg_0=1, var_59_arg_1=1, var_78=1] [L195] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L195] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L196] SORT_3 var_60_arg_0 = state_43; [L197] SORT_3 var_60_arg_1 = var_4; [L198] SORT_1 var_60 = var_60_arg_0 != var_60_arg_1; [L199] SORT_3 var_61_arg_0 = state_5; [L200] SORT_3 var_61_arg_1 = var_4; [L201] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L202] SORT_1 var_62_arg_0 = var_60; [L203] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_62_arg_0=0, var_62_arg_1=1, var_78=1] [L204] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_78=1] [L204] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L205] SORT_1 var_63_arg_0 = var_59; [L206] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63_arg_0=1, var_63_arg_1=1, var_78=1] [L207] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L207] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L208] SORT_3 var_64_arg_0 = state_43; [L209] SORT_3 var_64_arg_1 = var_4; [L210] SORT_1 var_64 = var_64_arg_0 != var_64_arg_1; [L211] SORT_3 var_65_arg_0 = state_5; [L212] SORT_3 var_65_arg_1 = var_4; [L213] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L214] SORT_1 var_66_arg_0 = var_64; [L215] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_66_arg_0=0, var_66_arg_1=1, var_78=1] [L216] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_78=1] [L216] SORT_1 var_66 = var_66_arg_0 | var_66_arg_1; [L217] SORT_1 var_67_arg_0 = var_63; [L218] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67_arg_0=1, var_67_arg_1=1, var_78=1] [L219] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L219] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L220] SORT_3 var_68_arg_0 = state_43; [L221] SORT_3 var_68_arg_1 = var_4; [L222] SORT_1 var_68 = var_68_arg_0 != var_68_arg_1; [L223] SORT_3 var_69_arg_0 = state_5; [L224] SORT_3 var_69_arg_1 = var_4; [L225] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L226] SORT_1 var_70_arg_0 = var_68; [L227] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_70_arg_0=0, var_70_arg_1=1, var_78=1] [L228] EXPR var_70_arg_0 | var_70_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_78=1] [L228] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L229] SORT_1 var_71_arg_0 = var_67; [L230] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_71_arg_0=1, var_71_arg_1=1, var_78=1] [L231] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L231] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L232] SORT_3 var_72_arg_0 = state_43; [L233] SORT_3 var_72_arg_1 = var_4; [L234] SORT_1 var_72 = var_72_arg_0 != var_72_arg_1; [L235] SORT_3 var_73_arg_0 = state_5; [L236] SORT_3 var_73_arg_1 = var_4; [L237] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L238] SORT_1 var_74_arg_0 = var_72; [L239] SORT_1 var_74_arg_1 = var_73; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_74_arg_0=0, var_74_arg_1=1, var_78=1] [L240] EXPR var_74_arg_0 | var_74_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_78=1] [L240] SORT_1 var_74 = var_74_arg_0 | var_74_arg_1; [L241] SORT_1 var_75_arg_0 = var_71; [L242] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_75_arg_0=1, var_75_arg_1=1, var_78=1] [L243] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L243] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L244] SORT_1 var_79_arg_0 = var_75; [L245] SORT_1 var_79 = ~var_79_arg_0; [L246] SORT_1 var_80_arg_0 = var_78; [L247] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1, var_80_arg_0=1, var_80_arg_1=-2] [L248] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L248] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L249] EXPR var_80 & mask_SORT_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L249] var_80 = var_80 & mask_SORT_1 [L250] SORT_1 bad_81_arg_0 = var_80; [L251] CALL __VERIFIER_assert(!(bad_81_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 86.5s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10203 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10203 mSDsluCounter, 98145 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86879 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28501 IncrementalHoareTripleChecker+Invalid, 28696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 11266 mSDtfsCounter, 28501 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 766 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=57, InterpolantAutomatonStates: 669, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 1841 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 11.6s SatisfiabilityAnalysisTime, 49.8s InterpolantComputationTime, 5193 NumberOfCodeBlocks, 5193 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5039 ConstructedInterpolants, 0 QuantifiedInterpolants, 17535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 PerfectInterpolantSequences, 0/0 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-27 20:27:34,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:27:36,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:27:36,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-27 20:27:36,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:27:36,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:27:36,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:27:36,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:27:36,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:27:36,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:27:36,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:27:36,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:27:36,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:27:36,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:27:36,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:27:36,887 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:27:36,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:27:36,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:27:36,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:27:36,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:27:36,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:27:36,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:27:36,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:27:36,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:27:36,890 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:27:36,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:27:36,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:27:36,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:27:36,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:27:36,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:27:36,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:27:36,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:27:36,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:27:36,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:27:36,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:27:36,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:27:36,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:27:36,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:27:36,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:27:36,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:27:36,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:27:36,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:27:36,894 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:27:36,894 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:27:36,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:27:36,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:27:36,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:27:36,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:27:36,895 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-27 20:27:37,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:27:37,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:27:37,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:27:37,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:27:37,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:27:37,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-27 20:27:40,210 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/35f2c7500/dcdbaa315ebf4bc1851396ec7deceb6c/FLAG3222116b9 [2024-11-27 20:27:40,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:27:40,454 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-27 20:27:40,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/35f2c7500/dcdbaa315ebf4bc1851396ec7deceb6c/FLAG3222116b9 [2024-11-27 20:27:40,484 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/data/35f2c7500/dcdbaa315ebf4bc1851396ec7deceb6c [2024-11-27 20:27:40,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:27:40,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:27:40,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:27:40,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:27:40,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:27:40,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669d86db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40, skipping insertion in model container [2024-11-27 20:27:40,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:27:40,704 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-27 20:27:40,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:27:40,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:27:40,823 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_42aaff96-1fbd-4af6-90a1-28a2e485909d/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-27 20:27:40,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:27:40,910 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:27:40,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40 WrapperNode [2024-11-27 20:27:40,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:27:40,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:27:40,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:27:40,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:27:40,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,972 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 253 [2024-11-27 20:27:40,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:27:40,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:27:40,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:27:40,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:27:40,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:40,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,014 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-27 20:27:41,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:27:41,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:27:41,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:27:41,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:27:41,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (1/1) ... [2024-11-27 20:27:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:27:41,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:41,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:27:41,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:27:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:27:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:27:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:27:41,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:27:41,296 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:27:41,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:27:41,784 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2024-11-27 20:27:41,784 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:27:41,793 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:27:41,794 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:27:41,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:27:41 BoogieIcfgContainer [2024-11-27 20:27:41,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:27:41,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:27:41,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:27:41,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:27:41,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:27:40" (1/3) ... [2024-11-27 20:27:41,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c60bb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:27:41, skipping insertion in model container [2024-11-27 20:27:41,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:27:40" (2/3) ... [2024-11-27 20:27:41,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c60bb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:27:41, skipping insertion in model container [2024-11-27 20:27:41,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:27:41" (3/3) ... [2024-11-27 20:27:41,827 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2024-11-27 20:27:41,843 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:27:41,845 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Barrel.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:27:41,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:27:41,933 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;@592afd36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:27:41,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:27:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:27:41,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:41,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:27:41,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-27 20:27:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:27:41,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721014932] [2024-11-27 20:27:41,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:41,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:41,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:27:41,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:27:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:42,330 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 142 conjuncts are in the unsatisfiable core [2024-11-27 20:27:42,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:27:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:44,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:27:44,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:27:44,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721014932] [2024-11-27 20:27:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721014932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:27:44,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:27:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:27:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973090861] [2024-11-27 20:27:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:27:44,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:27:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:27:44,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:27:44,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:44,079 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:27:44,146 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-27 20:27:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:27:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 20:27:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:27:44,158 INFO L225 Difference]: With dead ends: 17 [2024-11-27 20:27:44,159 INFO L226 Difference]: Without dead ends: 9 [2024-11-27 20:27:44,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:27:44,166 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:27:44,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:27:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-27 20:27:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-27 20:27:44,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-27 20:27:44,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-27 20:27:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:27:44,202 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-27 20:27:44,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:27:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-27 20:27:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:27:44,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:27:44,205 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:27:44,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:27:44,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:44,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:27:44,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:27:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-27 20:27:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:27:44,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672529120] [2024-11-27 20:27:44,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:27:44,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:44,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:27:44,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:27:44,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:27:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:27:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 147 conjuncts are in the unsatisfiable core [2024-11-27 20:27:44,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:27:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:27:45,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:27:58,176 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-27 20:27:58,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-27 20:27:58,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:27:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672529120] [2024-11-27 20:27:58,178 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-27 20:27:58,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 20:27:58,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:27:58,379 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:842) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-27 20:27:58,384 INFO L158 Benchmark]: Toolchain (without parser) took 17896.31ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 93.1MB in the beginning and 244.8MB in the end (delta: -151.7MB). Peak memory consumption was 277.4MB. Max. memory is 16.1GB. [2024-11-27 20:27:58,384 INFO L158 Benchmark]: CDTParser took 3.20ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:27:58,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.37ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:27:58,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.46ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:27:58,385 INFO L158 Benchmark]: Boogie Preprocessor took 81.18ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:27:58,386 INFO L158 Benchmark]: RCFGBuilder took 735.98ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 38.2MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:27:58,387 INFO L158 Benchmark]: TraceAbstraction took 16565.82ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 90.6MB in the beginning and 244.8MB in the end (delta: -154.2MB). Peak memory consumption was 272.4MB. Max. memory is 16.1GB. [2024-11-27 20:27:58,389 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.20ms. Allocated memory is still 83.9MB. Free memory is still 64.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.37ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 76.3MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.46ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 73.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.18ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 70.4MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 735.98ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 38.2MB in the end (delta: 32.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16565.82ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 90.6MB in the beginning and 244.8MB in the end (delta: -154.2MB). Peak memory consumption was 272.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42aaff96-1fbd-4af6-90a1-28a2e485909d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")