./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:29:13,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:29:13,202 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:29:13,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:29:13,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:29:13,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:29:13,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:29:13,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:29:13,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:29:13,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:29:13,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:29:13,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:29:13,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:29:13,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:29:13,238 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:29:13,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:29:13,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:29:13,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:29:13,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:29:13,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:29:13,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:29:13,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:29:13,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:29:13,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:29:13,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:29:13,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:29:13,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:29:13,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:29:13,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:29:13,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:29:13,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:29:13,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:29:13,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:29:13,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:29:13,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:29:13,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:29:13,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:29:13,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:29:13,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:29:13,248 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:29:13,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:29:13,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:29:13,249 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2023-11-29 00:29:13,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:29:13,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:29:13,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:29:13,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:29:13,522 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:29:13,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/locks/test_locks_5.c [2023-11-29 00:29:16,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:29:16,500 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:29:16,500 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/sv-benchmarks/c/locks/test_locks_5.c [2023-11-29 00:29:16,510 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/data/5311fabbe/299209b2ab1f42e1a1c579c440206c73/FLAGa3c47311a [2023-11-29 00:29:16,527 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/data/5311fabbe/299209b2ab1f42e1a1c579c440206c73 [2023-11-29 00:29:16,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:29:16,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:29:16,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:29:16,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:29:16,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:29:16,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d05737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16, skipping insertion in model container [2023-11-29 00:29:16,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:29:16,727 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/sv-benchmarks/c/locks/test_locks_5.c[2207,2220] [2023-11-29 00:29:16,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:29:16,742 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:29:16,765 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/sv-benchmarks/c/locks/test_locks_5.c[2207,2220] [2023-11-29 00:29:16,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:29:16,782 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:29:16,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16 WrapperNode [2023-11-29 00:29:16,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:29:16,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:29:16,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:29:16,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:29:16,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,824 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 88 [2023-11-29 00:29:16,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:29:16,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:29:16,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:29:16,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:29:16,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,846 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]. [2023-11-29 00:29:16,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:29:16,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:29:16,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:29:16,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:29:16,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (1/1) ... [2023-11-29 00:29:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:29:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:29:16,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:29:16,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:29:16,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:29:16,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:29:16,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:29:16,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:29:16,999 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:29:17,002 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:29:17,146 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:29:17,174 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:29:17,175 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:29:17,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:29:17 BoogieIcfgContainer [2023-11-29 00:29:17,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:29:17,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:29:17,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:29:17,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:29:17,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:29:16" (1/3) ... [2023-11-29 00:29:17,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401e3347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:29:17, skipping insertion in model container [2023-11-29 00:29:17,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:29:16" (2/3) ... [2023-11-29 00:29:17,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401e3347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:29:17, skipping insertion in model container [2023-11-29 00:29:17,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:29:17" (3/3) ... [2023-11-29 00:29:17,185 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2023-11-29 00:29:17,205 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:29:17,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:29:17,248 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:29:17,254 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@287243fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:29:17,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:29:17,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:29:17,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash 164520155, now seen corresponding path program 1 times [2023-11-29 00:29:17,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873191017] [2023-11-29 00:29:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873191017] [2023-11-29 00:29:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873191017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451449918] [2023-11-29 00:29:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,489 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-29 00:29:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,527 INFO L93 Difference]: Finished difference Result 48 states and 81 transitions. [2023-11-29 00:29:17,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:17,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2023-11-29 00:29:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,536 INFO L225 Difference]: With dead ends: 48 [2023-11-29 00:29:17,536 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 00:29:17,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,542 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 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 [2023-11-29 00:29:17,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:17,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 00:29:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2023-11-29 00:29:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2023-11-29 00:29:17,570 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 11 [2023-11-29 00:29:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,570 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2023-11-29 00:29:17,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-29 00:29:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2023-11-29 00:29:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:29:17,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:29:17,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -644826471, now seen corresponding path program 1 times [2023-11-29 00:29:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094051229] [2023-11-29 00:29:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094051229] [2023-11-29 00:29:17,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094051229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354186438] [2023-11-29 00:29:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,632 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-29 00:29:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,653 INFO L93 Difference]: Finished difference Result 63 states and 108 transitions. [2023-11-29 00:29:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2023-11-29 00:29:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,655 INFO L225 Difference]: With dead ends: 63 [2023-11-29 00:29:17,656 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 00:29:17,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,658 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:17,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 00:29:17,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-11-29 00:29:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 61 transitions. [2023-11-29 00:29:17,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 61 transitions. Word has length 11 [2023-11-29 00:29:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,668 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 61 transitions. [2023-11-29 00:29:17,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-29 00:29:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 61 transitions. [2023-11-29 00:29:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:29:17,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:29:17,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash 805372477, now seen corresponding path program 1 times [2023-11-29 00:29:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851481763] [2023-11-29 00:29:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851481763] [2023-11-29 00:29:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851481763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708640505] [2023-11-29 00:29:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,727 INFO L87 Difference]: Start difference. First operand 36 states and 61 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,747 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2023-11-29 00:29:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 00:29:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,749 INFO L225 Difference]: With dead ends: 59 [2023-11-29 00:29:17,749 INFO L226 Difference]: Without dead ends: 41 [2023-11-29 00:29:17,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,751 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:17,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-29 00:29:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2023-11-29 00:29:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2023-11-29 00:29:17,759 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 12 [2023-11-29 00:29:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,760 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2023-11-29 00:29:17,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2023-11-29 00:29:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:29:17,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:29:17,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1485430847, now seen corresponding path program 1 times [2023-11-29 00:29:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688620288] [2023-11-29 00:29:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688620288] [2023-11-29 00:29:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688620288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662876051] [2023-11-29 00:29:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,815 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,833 INFO L93 Difference]: Finished difference Result 72 states and 116 transitions. [2023-11-29 00:29:17,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 00:29:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,835 INFO L225 Difference]: With dead ends: 72 [2023-11-29 00:29:17,836 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 00:29:17,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,838 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:17,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 00:29:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-11-29 00:29:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 51 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) [2023-11-29 00:29:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2023-11-29 00:29:17,848 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 12 [2023-11-29 00:29:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,848 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 84 transitions. [2023-11-29 00:29:17,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 84 transitions. [2023-11-29 00:29:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:29:17,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:29:17,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 676084221, now seen corresponding path program 1 times [2023-11-29 00:29:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768034143] [2023-11-29 00:29:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768034143] [2023-11-29 00:29:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768034143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588779495] [2023-11-29 00:29:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,896 INFO L87 Difference]: Start difference. First operand 52 states and 84 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:17,917 INFO L93 Difference]: Finished difference Result 120 states and 194 transitions. [2023-11-29 00:29:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:17,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 00:29:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:17,920 INFO L225 Difference]: With dead ends: 120 [2023-11-29 00:29:17,920 INFO L226 Difference]: Without dead ends: 72 [2023-11-29 00:29:17,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,922 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:17,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:17,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-29 00:29:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-11-29 00:29:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 69 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2023-11-29 00:29:17,935 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 12 [2023-11-29 00:29:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:17,936 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2023-11-29 00:29:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2023-11-29 00:29:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:29:17,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:17,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:29:17,938 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:17,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1196068690, now seen corresponding path program 1 times [2023-11-29 00:29:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028245477] [2023-11-29 00:29:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:17,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:17,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028245477] [2023-11-29 00:29:17,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028245477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:17,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:17,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:17,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684385000] [2023-11-29 00:29:17,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:17,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:17,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:17,982 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,015 INFO L93 Difference]: Finished difference Result 107 states and 165 transitions. [2023-11-29 00:29:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:29:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,017 INFO L225 Difference]: With dead ends: 107 [2023-11-29 00:29:18,017 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 00:29:18,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,019 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 00:29:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2023-11-29 00:29:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 71 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2023-11-29 00:29:18,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 13 [2023-11-29 00:29:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,031 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2023-11-29 00:29:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2023-11-29 00:29:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:29:18,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:29:18,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -516010320, now seen corresponding path program 1 times [2023-11-29 00:29:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466427352] [2023-11-29 00:29:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466427352] [2023-11-29 00:29:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466427352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229541544] [2023-11-29 00:29:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,073 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,094 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2023-11-29 00:29:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:29:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,096 INFO L225 Difference]: With dead ends: 200 [2023-11-29 00:29:18,096 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 00:29:18,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,098 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 00:29:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2023-11-29 00:29:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4809160305343512) internal successors, (194), 131 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2023-11-29 00:29:18,116 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 13 [2023-11-29 00:29:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,117 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2023-11-29 00:29:18,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2023-11-29 00:29:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 00:29:18,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:29:18,119 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash 293336306, now seen corresponding path program 1 times [2023-11-29 00:29:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549236196] [2023-11-29 00:29:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549236196] [2023-11-29 00:29:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549236196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218633743] [2023-11-29 00:29:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,157 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,174 INFO L93 Difference]: Finished difference Result 160 states and 236 transitions. [2023-11-29 00:29:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-29 00:29:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,176 INFO L225 Difference]: With dead ends: 160 [2023-11-29 00:29:18,176 INFO L226 Difference]: Without dead ends: 158 [2023-11-29 00:29:18,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,178 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-29 00:29:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2023-11-29 00:29:18,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.450381679389313) internal successors, (190), 131 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 190 transitions. [2023-11-29 00:29:18,193 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 190 transitions. Word has length 13 [2023-11-29 00:29:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,194 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 190 transitions. [2023-11-29 00:29:18,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 190 transitions. [2023-11-29 00:29:18,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:29:18,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:29:18,196 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1183764914, now seen corresponding path program 1 times [2023-11-29 00:29:18,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446479967] [2023-11-29 00:29:18,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446479967] [2023-11-29 00:29:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446479967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291757616] [2023-11-29 00:29:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,230 INFO L87 Difference]: Start difference. First operand 132 states and 190 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,250 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2023-11-29 00:29:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 00:29:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,253 INFO L225 Difference]: With dead ends: 228 [2023-11-29 00:29:18,253 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 00:29:18,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,254 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 00:29:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 192. [2023-11-29 00:29:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4136125654450262) internal successors, (270), 191 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2023-11-29 00:29:18,272 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 14 [2023-11-29 00:29:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,272 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2023-11-29 00:29:18,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2023-11-29 00:29:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:29:18,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:29:18,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash 374418288, now seen corresponding path program 1 times [2023-11-29 00:29:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998109912] [2023-11-29 00:29:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998109912] [2023-11-29 00:29:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998109912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446121460] [2023-11-29 00:29:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,304 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,326 INFO L93 Difference]: Finished difference Result 436 states and 608 transitions. [2023-11-29 00:29:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 00:29:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,328 INFO L225 Difference]: With dead ends: 436 [2023-11-29 00:29:18,329 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 00:29:18,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,330 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 00:29:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2023-11-29 00:29:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.3360323886639676) internal successors, (330), 247 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 330 transitions. [2023-11-29 00:29:18,349 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 330 transitions. Word has length 14 [2023-11-29 00:29:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,349 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 330 transitions. [2023-11-29 00:29:18,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 330 transitions. [2023-11-29 00:29:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:29:18,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:29:18,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1957777339, now seen corresponding path program 1 times [2023-11-29 00:29:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613786530] [2023-11-29 00:29:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613786530] [2023-11-29 00:29:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613786530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511738489] [2023-11-29 00:29:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,378 INFO L87 Difference]: Start difference. First operand 248 states and 330 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,397 INFO L93 Difference]: Finished difference Result 380 states and 504 transitions. [2023-11-29 00:29:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:29:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,400 INFO L225 Difference]: With dead ends: 380 [2023-11-29 00:29:18,400 INFO L226 Difference]: Without dead ends: 262 [2023-11-29 00:29:18,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,401 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-11-29 00:29:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2023-11-29 00:29:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 259 states have (on average 1.305019305019305) internal successors, (338), 259 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 338 transitions. [2023-11-29 00:29:18,418 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 338 transitions. Word has length 15 [2023-11-29 00:29:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,418 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 338 transitions. [2023-11-29 00:29:18,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 338 transitions. [2023-11-29 00:29:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:29:18,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:29:18,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1277718969, now seen corresponding path program 1 times [2023-11-29 00:29:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718357614] [2023-11-29 00:29:18,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718357614] [2023-11-29 00:29:18,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718357614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175234747] [2023-11-29 00:29:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,447 INFO L87 Difference]: Start difference. First operand 260 states and 338 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,474 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2023-11-29 00:29:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:29:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,478 INFO L225 Difference]: With dead ends: 422 [2023-11-29 00:29:18,478 INFO L226 Difference]: Without dead ends: 420 [2023-11-29 00:29:18,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,480 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-11-29 00:29:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 388. [2023-11-29 00:29:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.2661498708010337) internal successors, (490), 387 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2023-11-29 00:29:18,503 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 15 [2023-11-29 00:29:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,503 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2023-11-29 00:29:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2023-11-29 00:29:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:29:18,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:29:18,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:29:18,505 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:29:18,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:29:18,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2087065595, now seen corresponding path program 1 times [2023-11-29 00:29:18,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:29:18,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483365667] [2023-11-29 00:29:18,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:29:18,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:29:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:29:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:29:18,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:29:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483365667] [2023-11-29 00:29:18,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483365667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:29:18,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:29:18,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:29:18,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82524489] [2023-11-29 00:29:18,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:29:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:29:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:29:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:29:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,530 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:29:18,565 INFO L93 Difference]: Finished difference Result 852 states and 1050 transitions. [2023-11-29 00:29:18,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:29:18,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:29:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:29:18,566 INFO L225 Difference]: With dead ends: 852 [2023-11-29 00:29:18,566 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 00:29:18,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:29:18,568 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:29:18,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 72 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:29:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 00:29:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 00:29:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 00:29:18,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-11-29 00:29:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:29:18,569 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 00:29:18,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:29:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 00:29:18,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 00:29:18,572 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:29:18,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:29:18,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 00:29:18,586 INFO L902 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2023-11-29 00:29:18,586 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-11-29 00:29:18,586 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 6 95) no Hoare annotation was computed. [2023-11-29 00:29:18,586 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L91(lines 7 95) no Hoare annotation was computed. [2023-11-29 00:29:18,587 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 7 95) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,588 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 00:29:18,589 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2023-11-29 00:29:18,589 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2023-11-29 00:29:18,592 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:29:18,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:29:18,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:29:18 BoogieIcfgContainer [2023-11-29 00:29:18,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:29:18,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:29:18,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:29:18,607 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:29:18,607 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:29:17" (3/4) ... [2023-11-29 00:29:18,610 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 00:29:18,620 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-29 00:29:18,620 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 00:29:18,620 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 00:29:18,621 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 00:29:18,724 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:29:18,725 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 00:29:18,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:29:18,725 INFO L158 Benchmark]: Toolchain (without parser) took 2193.36ms. Allocated memory is still 172.0MB. Free memory was 125.6MB in the beginning and 58.8MB in the end (delta: 66.8MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,726 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 68.6MB in the beginning and 68.5MB in the end (delta: 98.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:29:18,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.35ms. Allocated memory is still 172.0MB. Free memory was 125.6MB in the beginning and 115.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,727 INFO L158 Benchmark]: Boogie Preprocessor took 32.50ms. Allocated memory is still 172.0MB. Free memory was 113.0MB in the beginning and 111.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,728 INFO L158 Benchmark]: RCFGBuilder took 317.33ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,728 INFO L158 Benchmark]: TraceAbstraction took 1427.43ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 63.0MB in the end (delta: 35.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,728 INFO L158 Benchmark]: Witness Printer took 118.48ms. Allocated memory is still 172.0MB. Free memory was 63.0MB in the beginning and 58.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:29:18,731 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.17ms. Allocated memory is still 121.6MB. Free memory was 68.6MB in the beginning and 68.5MB in the end (delta: 98.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.35ms. Allocated memory is still 172.0MB. Free memory was 125.6MB in the beginning and 115.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 172.0MB. Free memory was 115.1MB in the beginning and 113.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.50ms. Allocated memory is still 172.0MB. Free memory was 113.0MB in the beginning and 111.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 317.33ms. Allocated memory is still 172.0MB. Free memory was 111.7MB in the beginning and 99.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1427.43ms. Allocated memory is still 172.0MB. Free memory was 98.4MB in the beginning and 63.0MB in the end (delta: 35.4MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 118.48ms. Allocated memory is still 172.0MB. Free memory was 63.0MB in the beginning and 58.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 343 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 544 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=12, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 34 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-29 00:29:18,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc8e35cb-600d-46f9-9db3-e94eb9540ffc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE