./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/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_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/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_56fe4ade-2943-48bf-83d9-504b262f737f/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 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:01:53,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:01:54,025 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:01:54,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:01:54,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:01:54,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:01:54,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:01:54,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:01:54,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:01:54,058 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:01:54,058 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:01:54,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:01:54,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:01:54,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:01:54,061 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:01:54,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:01:54,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:01:54,062 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:01:54,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:01:54,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:01:54,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:01:54,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:01:54,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:01:54,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:01:54,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:01:54,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:01:54,066 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:01:54,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:01:54,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:01:54,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:01:54,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:01:54,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:54,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:01:54,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:01:54,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:01:54,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:01:54,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:01:54,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:01:54,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:01:54,071 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:01:54,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:01:54,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:01:54,072 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_56fe4ade-2943-48bf-83d9-504b262f737f/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_56fe4ade-2943-48bf-83d9-504b262f737f/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 -> 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e [2023-11-29 07:01:54,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:01:54,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:01:54,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:01:54,302 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:01:54,303 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:01:54,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:01:57,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:01:57,297 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:01:57,297 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:01:57,309 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/ff2769a73/ce3e8400e48b4fb69eb113bd0c04a3ae/FLAGaf675abad [2023-11-29 07:01:57,323 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/ff2769a73/ce3e8400e48b4fb69eb113bd0c04a3ae [2023-11-29 07:01:57,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:01:57,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:01:57,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:57,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:01:57,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:01:57,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3297590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57, skipping insertion in model container [2023-11-29 07:01:57,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,370 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:01:57,502 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_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2023-11-29 07:01:57,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:57,588 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:01:57,598 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_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2023-11-29 07:01:57,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:57,652 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:01:57,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57 WrapperNode [2023-11-29 07:01:57,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:57,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:57,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:01:57,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:01:57,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,712 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2023-11-29 07:01:57,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:57,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:01:57,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:01:57,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:01:57,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,749 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 07:01:57,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:01:57,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:01:57,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:01:57,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:01:57,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (1/1) ... [2023-11-29 07:01:57,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:01:57,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:01:57,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:01:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:01:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:01:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:01:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:01:57,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:01:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:01:57,933 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:01:57,935 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:01:58,342 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:01:58,410 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:01:58,410 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:01:58,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:58 BoogieIcfgContainer [2023-11-29 07:01:58,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:01:58,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:01:58,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:01:58,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:01:58,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:01:57" (1/3) ... [2023-11-29 07:01:58,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764fef18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:58, skipping insertion in model container [2023-11-29 07:01:58,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:57" (2/3) ... [2023-11-29 07:01:58,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764fef18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:58, skipping insertion in model container [2023-11-29 07:01:58,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:58" (3/3) ... [2023-11-29 07:01:58,421 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:01:58,437 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:01:58,437 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:01:58,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:01:58,487 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;@3ccc43b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:01:58,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:01:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:01:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:01:58,505 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:58,505 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:58,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:58,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 984363983, now seen corresponding path program 1 times [2023-11-29 07:01:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:58,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133603602] [2023-11-29 07:01:58,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:58,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:01:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:01:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:01:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:01:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:01:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:01:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:01:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:01:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:01:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:01:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:01:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:01:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:01:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:01:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:01:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:01:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133603602] [2023-11-29 07:01:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133603602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900946650] [2023-11-29 07:01:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:58,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:01:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:01:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:01:58,973 INFO L87 Difference]: Start difference. First operand has 86 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 62 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 07:01:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:59,021 INFO L93 Difference]: Finished difference Result 167 states and 296 transitions. [2023-11-29 07:01:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:01:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2023-11-29 07:01:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:59,033 INFO L225 Difference]: With dead ends: 167 [2023-11-29 07:01:59,034 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 07:01:59,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:01:59,042 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:59,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:01:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 07:01:59,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-29 07:01:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 58 states have internal predecessors, (85), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:01:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2023-11-29 07:01:59,094 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 154 [2023-11-29 07:01:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:59,095 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2023-11-29 07:01:59,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 07:01:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2023-11-29 07:01:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:01:59,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:59,100 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:59,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:01:59,101 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:59,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash -64891813, now seen corresponding path program 1 times [2023-11-29 07:01:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759200254] [2023-11-29 07:01:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:01:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:01:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:01:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:01:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:01:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:01:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:01:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:01:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:01:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:01:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:01:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:01:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:01:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:01:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:01:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:01:59,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:59,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759200254] [2023-11-29 07:01:59,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759200254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:59,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:59,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:01:59,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533147050] [2023-11-29 07:01:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:59,365 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:01:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:59,429 INFO L93 Difference]: Finished difference Result 200 states and 317 transitions. [2023-11-29 07:01:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 07:01:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:59,433 INFO L225 Difference]: With dead ends: 200 [2023-11-29 07:01:59,433 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 07:01:59,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:01:59,436 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 56 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:59,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 236 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:01:59,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 07:01:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2023-11-29 07:01:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:01:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2023-11-29 07:01:59,452 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 154 [2023-11-29 07:01:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:59,454 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2023-11-29 07:01:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:01:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2023-11-29 07:01:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:01:59,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:59,459 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:01:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:01:59,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 75656797, now seen corresponding path program 1 times [2023-11-29 07:01:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257543241] [2023-11-29 07:01:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:01:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:01:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:01:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:01:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:01:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:01:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:01:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:01:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:01:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:01:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:01:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:01:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:01:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:01:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:01:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:01:59,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257543241] [2023-11-29 07:01:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257543241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056885774] [2023-11-29 07:01:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:01:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:01:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:01:59,967 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:00,410 INFO L93 Difference]: Finished difference Result 277 states and 436 transitions. [2023-11-29 07:02:00,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:00,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 07:02:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:00,414 INFO L225 Difference]: With dead ends: 277 [2023-11-29 07:02:00,415 INFO L226 Difference]: Without dead ends: 185 [2023-11-29 07:02:00,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:00,417 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:00,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 378 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:02:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-29 07:02:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 128. [2023-11-29 07:02:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 104 states have internal predecessors, (157), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:02:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2023-11-29 07:02:00,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 154 [2023-11-29 07:02:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:00,444 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2023-11-29 07:02:00,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2023-11-29 07:02:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:02:00,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:00,447 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:00,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:02:00,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:00,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1729781537, now seen corresponding path program 1 times [2023-11-29 07:02:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:00,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921461741] [2023-11-29 07:02:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921461741] [2023-11-29 07:02:00,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921461741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:00,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:00,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:00,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789543956] [2023-11-29 07:02:00,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:00,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:00,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:00,773 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:00,827 INFO L93 Difference]: Finished difference Result 259 states and 404 transitions. [2023-11-29 07:02:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 07:02:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:00,831 INFO L225 Difference]: With dead ends: 259 [2023-11-29 07:02:00,831 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 07:02:00,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 07:02:00,833 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:00,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 165 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 07:02:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-11-29 07:02:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:02:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2023-11-29 07:02:00,855 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 154 [2023-11-29 07:02:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:00,856 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2023-11-29 07:02:00,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2023-11-29 07:02:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:02:00,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:00,859 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:00,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:02:00,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:00,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1978379745, now seen corresponding path program 1 times [2023-11-29 07:02:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301528820] [2023-11-29 07:02:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:00,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:02,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:02,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301528820] [2023-11-29 07:02:02,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301528820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:02,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:02:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253030170] [2023-11-29 07:02:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:02:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:02:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:02,532 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:03,641 INFO L93 Difference]: Finished difference Result 459 states and 697 transitions. [2023-11-29 07:02:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:02:03,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 07:02:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:03,645 INFO L225 Difference]: With dead ends: 459 [2023-11-29 07:02:03,646 INFO L226 Difference]: Without dead ends: 328 [2023-11-29 07:02:03,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:02:03,647 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 333 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:03,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 447 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 07:02:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-11-29 07:02:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 238. [2023-11-29 07:02:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 210 states have (on average 1.519047619047619) internal successors, (319), 211 states have internal predecessors, (319), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 07:02:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 367 transitions. [2023-11-29 07:02:03,700 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 367 transitions. Word has length 154 [2023-11-29 07:02:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:03,701 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 367 transitions. [2023-11-29 07:02:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 367 transitions. [2023-11-29 07:02:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 07:02:03,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:03,704 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:03,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:02:03,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:03,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1468906655, now seen corresponding path program 1 times [2023-11-29 07:02:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285864349] [2023-11-29 07:02:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:03,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285864349] [2023-11-29 07:02:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285864349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:04,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:02:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788078685] [2023-11-29 07:02:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:04,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:02:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:02:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:02:04,647 INFO L87 Difference]: Start difference. First operand 238 states and 367 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:05,992 INFO L93 Difference]: Finished difference Result 852 states and 1295 transitions. [2023-11-29 07:02:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 07:02:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2023-11-29 07:02:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:06,000 INFO L225 Difference]: With dead ends: 852 [2023-11-29 07:02:06,000 INFO L226 Difference]: Without dead ends: 614 [2023-11-29 07:02:06,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2023-11-29 07:02:06,002 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 506 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:06,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1265 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 07:02:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-11-29 07:02:06,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 436. [2023-11-29 07:02:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 384 states have (on average 1.5182291666666667) internal successors, (583), 385 states have internal predecessors, (583), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 675 transitions. [2023-11-29 07:02:06,069 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 675 transitions. Word has length 154 [2023-11-29 07:02:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:06,070 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 675 transitions. [2023-11-29 07:02:06,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 675 transitions. [2023-11-29 07:02:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:06,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:06,073 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:06,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:02:06,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:06,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1029078192, now seen corresponding path program 1 times [2023-11-29 07:02:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37924580] [2023-11-29 07:02:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:07,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37924580] [2023-11-29 07:02:07,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37924580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:07,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:02:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972271630] [2023-11-29 07:02:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:07,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:02:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:02:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:02:07,084 INFO L87 Difference]: Start difference. First operand 436 states and 675 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:07,862 INFO L93 Difference]: Finished difference Result 1411 states and 2173 transitions. [2023-11-29 07:02:07,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 07:02:07,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:07,869 INFO L225 Difference]: With dead ends: 1411 [2023-11-29 07:02:07,869 INFO L226 Difference]: Without dead ends: 976 [2023-11-29 07:02:07,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2023-11-29 07:02:07,872 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 223 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:07,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 798 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:02:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-29 07:02:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 578. [2023-11-29 07:02:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 526 states have (on average 1.5190114068441065) internal successors, (799), 527 states have internal predecessors, (799), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 891 transitions. [2023-11-29 07:02:07,935 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 891 transitions. Word has length 155 [2023-11-29 07:02:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:07,936 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 891 transitions. [2023-11-29 07:02:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 891 transitions. [2023-11-29 07:02:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:07,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:07,939 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:07,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 07:02:07,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:07,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 354798581, now seen corresponding path program 1 times [2023-11-29 07:02:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360068688] [2023-11-29 07:02:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360068688] [2023-11-29 07:02:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360068688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644122649] [2023-11-29 07:02:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:08,105 INFO L87 Difference]: Start difference. First operand 578 states and 891 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:08,246 INFO L93 Difference]: Finished difference Result 1407 states and 2158 transitions. [2023-11-29 07:02:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:08,253 INFO L225 Difference]: With dead ends: 1407 [2023-11-29 07:02:08,253 INFO L226 Difference]: Without dead ends: 830 [2023-11-29 07:02:08,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:02:08,256 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 97 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:08,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 269 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-11-29 07:02:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 651. [2023-11-29 07:02:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 599 states have (on average 1.5141903171953255) internal successors, (907), 600 states have internal predecessors, (907), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 999 transitions. [2023-11-29 07:02:08,342 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 999 transitions. Word has length 155 [2023-11-29 07:02:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:08,343 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 999 transitions. [2023-11-29 07:02:08,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 999 transitions. [2023-11-29 07:02:08,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:08,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:08,346 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:02:08,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:08,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1794029177, now seen corresponding path program 1 times [2023-11-29 07:02:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843145521] [2023-11-29 07:02:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:09,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:09,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843145521] [2023-11-29 07:02:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843145521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:09,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:09,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:09,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519638071] [2023-11-29 07:02:09,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:09,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:09,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:09,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:09,149 INFO L87 Difference]: Start difference. First operand 651 states and 999 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:09,338 INFO L93 Difference]: Finished difference Result 1076 states and 1649 transitions. [2023-11-29 07:02:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:09,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:09,343 INFO L225 Difference]: With dead ends: 1076 [2023-11-29 07:02:09,343 INFO L226 Difference]: Without dead ends: 666 [2023-11-29 07:02:09,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:09,345 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 58 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:09,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 366 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2023-11-29 07:02:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2023-11-29 07:02:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 611 states have (on average 1.5040916530278232) internal successors, (919), 612 states have internal predecessors, (919), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1011 transitions. [2023-11-29 07:02:09,418 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1011 transitions. Word has length 155 [2023-11-29 07:02:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:09,418 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1011 transitions. [2023-11-29 07:02:09,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1011 transitions. [2023-11-29 07:02:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:09,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:09,421 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:09,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:02:09,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:09,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 782911927, now seen corresponding path program 1 times [2023-11-29 07:02:09,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:09,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636350247] [2023-11-29 07:02:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636350247] [2023-11-29 07:02:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636350247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:10,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:10,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 07:02:10,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559085489] [2023-11-29 07:02:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:10,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:02:10,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:02:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:02:10,241 INFO L87 Difference]: Start difference. First operand 663 states and 1011 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:12,175 INFO L93 Difference]: Finished difference Result 1741 states and 2621 transitions. [2023-11-29 07:02:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 07:02:12,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:12,182 INFO L225 Difference]: With dead ends: 1741 [2023-11-29 07:02:12,182 INFO L226 Difference]: Without dead ends: 1079 [2023-11-29 07:02:12,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2023-11-29 07:02:12,184 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 391 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:12,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1553 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 07:02:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2023-11-29 07:02:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 719. [2023-11-29 07:02:12,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 667 states have (on average 1.4992503748125936) internal successors, (1000), 668 states have internal predecessors, (1000), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1092 transitions. [2023-11-29 07:02:12,311 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1092 transitions. Word has length 155 [2023-11-29 07:02:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:12,312 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 1092 transitions. [2023-11-29 07:02:12,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1092 transitions. [2023-11-29 07:02:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:12,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:12,315 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:02:12,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:12,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 895064686, now seen corresponding path program 1 times [2023-11-29 07:02:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415170398] [2023-11-29 07:02:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415170398] [2023-11-29 07:02:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415170398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:14,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 07:02:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271859448] [2023-11-29 07:02:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:02:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:02:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:02:14,261 INFO L87 Difference]: Start difference. First operand 719 states and 1092 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:15,890 INFO L93 Difference]: Finished difference Result 1403 states and 2112 transitions. [2023-11-29 07:02:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 07:02:15,891 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:15,896 INFO L225 Difference]: With dead ends: 1403 [2023-11-29 07:02:15,896 INFO L226 Difference]: Without dead ends: 940 [2023-11-29 07:02:15,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2023-11-29 07:02:15,898 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 517 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:15,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 574 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 07:02:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-29 07:02:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 749. [2023-11-29 07:02:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 697 states have (on average 1.497847919655667) internal successors, (1044), 698 states have internal predecessors, (1044), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:15,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1136 transitions. [2023-11-29 07:02:15,981 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1136 transitions. Word has length 155 [2023-11-29 07:02:15,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:15,981 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1136 transitions. [2023-11-29 07:02:15,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1136 transitions. [2023-11-29 07:02:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:15,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:15,984 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:15,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 07:02:15,985 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:15,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash -956189456, now seen corresponding path program 1 times [2023-11-29 07:02:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344051324] [2023-11-29 07:02:15,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:15,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:16,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344051324] [2023-11-29 07:02:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344051324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:16,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773935172] [2023-11-29 07:02:16,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:16,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:16,102 INFO L87 Difference]: Start difference. First operand 749 states and 1136 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:16,245 INFO L93 Difference]: Finished difference Result 1732 states and 2633 transitions. [2023-11-29 07:02:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:16,251 INFO L225 Difference]: With dead ends: 1732 [2023-11-29 07:02:16,252 INFO L226 Difference]: Without dead ends: 984 [2023-11-29 07:02:16,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:02:16,254 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:16,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 282 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2023-11-29 07:02:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 741. [2023-11-29 07:02:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 689 states have (on average 1.4586357039187228) internal successors, (1005), 690 states have internal predecessors, (1005), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1097 transitions. [2023-11-29 07:02:16,368 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1097 transitions. Word has length 155 [2023-11-29 07:02:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:16,368 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1097 transitions. [2023-11-29 07:02:16,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1097 transitions. [2023-11-29 07:02:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:16,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:16,372 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:16,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 07:02:16,372 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:16,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:16,373 INFO L85 PathProgramCache]: Analyzing trace with hash -4064771, now seen corresponding path program 1 times [2023-11-29 07:02:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807521635] [2023-11-29 07:02:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807521635] [2023-11-29 07:02:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807521635] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376403779] [2023-11-29 07:02:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:16,521 INFO L87 Difference]: Start difference. First operand 741 states and 1097 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:16,775 INFO L93 Difference]: Finished difference Result 1604 states and 2367 transitions. [2023-11-29 07:02:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:16,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:16,781 INFO L225 Difference]: With dead ends: 1604 [2023-11-29 07:02:16,782 INFO L226 Difference]: Without dead ends: 864 [2023-11-29 07:02:16,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:02:16,784 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 95 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 295 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2023-11-29 07:02:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 665. [2023-11-29 07:02:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 613 states have (on average 1.4371941272430668) internal successors, (881), 614 states have internal predecessors, (881), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 973 transitions. [2023-11-29 07:02:16,905 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 973 transitions. Word has length 155 [2023-11-29 07:02:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:16,906 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 973 transitions. [2023-11-29 07:02:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 973 transitions. [2023-11-29 07:02:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 07:02:16,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:16,909 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:16,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:02:16,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:16,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2013699216, now seen corresponding path program 1 times [2023-11-29 07:02:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046956019] [2023-11-29 07:02:16,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046956019] [2023-11-29 07:02:17,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046956019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:17,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006088081] [2023-11-29 07:02:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:17,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:17,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:17,363 INFO L87 Difference]: Start difference. First operand 665 states and 973 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:17,897 INFO L93 Difference]: Finished difference Result 1334 states and 1951 transitions. [2023-11-29 07:02:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:02:17,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2023-11-29 07:02:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:17,901 INFO L225 Difference]: With dead ends: 1334 [2023-11-29 07:02:17,901 INFO L226 Difference]: Without dead ends: 668 [2023-11-29 07:02:17,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:02:17,903 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 165 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:17,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 492 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-11-29 07:02:17,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 618. [2023-11-29 07:02:17,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 566 states have (on average 1.4275618374558303) internal successors, (808), 567 states have internal predecessors, (808), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 07:02:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 900 transitions. [2023-11-29 07:02:17,976 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 900 transitions. Word has length 155 [2023-11-29 07:02:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:17,976 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 900 transitions. [2023-11-29 07:02:17,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:17,976 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 900 transitions. [2023-11-29 07:02:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:17,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:17,978 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:17,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:02:17,978 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:17,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -238934999, now seen corresponding path program 1 times [2023-11-29 07:02:17,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:17,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125972338] [2023-11-29 07:02:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:17,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:18,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125972338] [2023-11-29 07:02:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125972338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:18,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:18,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:02:18,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209369330] [2023-11-29 07:02:18,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:18,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:02:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:18,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:02:18,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:18,510 INFO L87 Difference]: Start difference. First operand 618 states and 900 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:18,932 INFO L93 Difference]: Finished difference Result 1321 states and 1908 transitions. [2023-11-29 07:02:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:02:18,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:18,937 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 07:02:18,937 INFO L226 Difference]: Without dead ends: 890 [2023-11-29 07:02:18,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:02:18,939 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 213 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:18,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 696 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-11-29 07:02:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 694. [2023-11-29 07:02:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 639 states have (on average 1.4162754303599374) internal successors, (905), 641 states have internal predecessors, (905), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:02:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1001 transitions. [2023-11-29 07:02:19,058 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1001 transitions. Word has length 156 [2023-11-29 07:02:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:19,058 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 1001 transitions. [2023-11-29 07:02:19,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1001 transitions. [2023-11-29 07:02:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:19,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:19,061 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:19,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 07:02:19,061 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:19,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:19,061 INFO L85 PathProgramCache]: Analyzing trace with hash -372948505, now seen corresponding path program 1 times [2023-11-29 07:02:19,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106372549] [2023-11-29 07:02:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106372549] [2023-11-29 07:02:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106372549] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:19,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:19,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 07:02:19,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969842704] [2023-11-29 07:02:19,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:19,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:02:19,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:19,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:02:19,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:02:19,514 INFO L87 Difference]: Start difference. First operand 694 states and 1001 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:20,040 INFO L93 Difference]: Finished difference Result 1617 states and 2325 transitions. [2023-11-29 07:02:20,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 07:02:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:20,045 INFO L225 Difference]: With dead ends: 1617 [2023-11-29 07:02:20,045 INFO L226 Difference]: Without dead ends: 924 [2023-11-29 07:02:20,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:02:20,047 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 98 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:20,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1006 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2023-11-29 07:02:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 781. [2023-11-29 07:02:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 726 states have (on average 1.4146005509641872) internal successors, (1027), 728 states have internal predecessors, (1027), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:02:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1123 transitions. [2023-11-29 07:02:20,163 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1123 transitions. Word has length 156 [2023-11-29 07:02:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:20,163 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1123 transitions. [2023-11-29 07:02:20,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1123 transitions. [2023-11-29 07:02:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:20,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:20,166 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:20,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 07:02:20,166 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:20,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2116425276, now seen corresponding path program 1 times [2023-11-29 07:02:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770198120] [2023-11-29 07:02:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:20,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770198120] [2023-11-29 07:02:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770198120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:02:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034636036] [2023-11-29 07:02:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:20,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:02:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:02:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:02:20,540 INFO L87 Difference]: Start difference. First operand 781 states and 1123 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:21,045 INFO L93 Difference]: Finished difference Result 1484 states and 2123 transitions. [2023-11-29 07:02:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:02:21,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:21,049 INFO L225 Difference]: With dead ends: 1484 [2023-11-29 07:02:21,049 INFO L226 Difference]: Without dead ends: 960 [2023-11-29 07:02:21,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:21,050 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 104 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:21,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 697 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2023-11-29 07:02:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 794. [2023-11-29 07:02:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 739 states have (on average 1.4167794316644113) internal successors, (1047), 741 states have internal predecessors, (1047), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:02:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1143 transitions. [2023-11-29 07:02:21,176 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1143 transitions. Word has length 156 [2023-11-29 07:02:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:21,176 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1143 transitions. [2023-11-29 07:02:21,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1143 transitions. [2023-11-29 07:02:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:21,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:21,179 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 07:02:21,179 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:21,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1559883466, now seen corresponding path program 1 times [2023-11-29 07:02:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:21,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245279727] [2023-11-29 07:02:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245279727] [2023-11-29 07:02:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245279727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:02:21,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568626357] [2023-11-29 07:02:21,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:21,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:02:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:21,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:02:21,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:21,724 INFO L87 Difference]: Start difference. First operand 794 states and 1143 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:22,235 INFO L93 Difference]: Finished difference Result 1740 states and 2504 transitions. [2023-11-29 07:02:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:02:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:22,240 INFO L225 Difference]: With dead ends: 1740 [2023-11-29 07:02:22,240 INFO L226 Difference]: Without dead ends: 1203 [2023-11-29 07:02:22,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-11-29 07:02:22,241 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 159 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:22,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 610 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2023-11-29 07:02:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 799. [2023-11-29 07:02:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 744 states have (on average 1.418010752688172) internal successors, (1055), 746 states have internal predecessors, (1055), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:02:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1151 transitions. [2023-11-29 07:02:22,351 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1151 transitions. Word has length 156 [2023-11-29 07:02:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:22,352 INFO L495 AbstractCegarLoop]: Abstraction has 799 states and 1151 transitions. [2023-11-29 07:02:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1151 transitions. [2023-11-29 07:02:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:22,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:22,354 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 07:02:22,355 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:22,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 324315437, now seen corresponding path program 1 times [2023-11-29 07:02:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005848564] [2023-11-29 07:02:22,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005848564] [2023-11-29 07:02:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005848564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869216746] [2023-11-29 07:02:22,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:22,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:22,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:22,454 INFO L87 Difference]: Start difference. First operand 799 states and 1151 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:22,673 INFO L93 Difference]: Finished difference Result 1927 states and 2772 transitions. [2023-11-29 07:02:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:22,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:22,680 INFO L225 Difference]: With dead ends: 1927 [2023-11-29 07:02:22,680 INFO L226 Difference]: Without dead ends: 1129 [2023-11-29 07:02:22,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:02:22,682 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 103 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:22,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 268 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2023-11-29 07:02:22,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 811. [2023-11-29 07:02:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 756 states have (on average 1.414021164021164) internal successors, (1069), 758 states have internal predecessors, (1069), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 07:02:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1165 transitions. [2023-11-29 07:02:22,825 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1165 transitions. Word has length 156 [2023-11-29 07:02:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:22,825 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 1165 transitions. [2023-11-29 07:02:22,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1165 transitions. [2023-11-29 07:02:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:22,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:22,827 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:22,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 07:02:22,828 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:22,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 381573739, now seen corresponding path program 1 times [2023-11-29 07:02:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479219518] [2023-11-29 07:02:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479219518] [2023-11-29 07:02:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479219518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765491609] [2023-11-29 07:02:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:23,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:23,230 INFO L87 Difference]: Start difference. First operand 811 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:23,526 INFO L93 Difference]: Finished difference Result 1622 states and 2327 transitions. [2023-11-29 07:02:23,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:02:23,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:23,531 INFO L225 Difference]: With dead ends: 1622 [2023-11-29 07:02:23,531 INFO L226 Difference]: Without dead ends: 1072 [2023-11-29 07:02:23,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:23,532 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 152 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:23,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 426 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2023-11-29 07:02:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 861. [2023-11-29 07:02:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 781 states have (on average 1.4007682458386683) internal successors, (1094), 783 states have internal predecessors, (1094), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 07:02:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1234 transitions. [2023-11-29 07:02:23,692 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1234 transitions. Word has length 156 [2023-11-29 07:02:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:23,692 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1234 transitions. [2023-11-29 07:02:23,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1234 transitions. [2023-11-29 07:02:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:23,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:23,694 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 07:02:23,694 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:23,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1758532092, now seen corresponding path program 1 times [2023-11-29 07:02:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828638810] [2023-11-29 07:02:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 07:02:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 07:02:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 07:02:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 07:02:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 07:02:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 07:02:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 07:02:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 07:02:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 07:02:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 07:02:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 07:02:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 07:02:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 07:02:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 07:02:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:02:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828638810] [2023-11-29 07:02:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828638810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:23,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356244949] [2023-11-29 07:02:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:23,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:23,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:23,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:23,789 INFO L87 Difference]: Start difference. First operand 861 states and 1234 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:24,101 INFO L93 Difference]: Finished difference Result 1982 states and 2838 transitions. [2023-11-29 07:02:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:24,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2023-11-29 07:02:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:24,106 INFO L225 Difference]: With dead ends: 1982 [2023-11-29 07:02:24,106 INFO L226 Difference]: Without dead ends: 1172 [2023-11-29 07:02:24,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 07:02:24,108 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 104 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:24,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 230 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-29 07:02:24,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 993. [2023-11-29 07:02:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 913 states have (on average 1.4085432639649507) internal successors, (1286), 915 states have internal predecessors, (1286), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 07:02:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1426 transitions. [2023-11-29 07:02:24,273 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1426 transitions. Word has length 156 [2023-11-29 07:02:24,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:24,273 INFO L495 AbstractCegarLoop]: Abstraction has 993 states and 1426 transitions. [2023-11-29 07:02:24,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:24,273 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1426 transitions. [2023-11-29 07:02:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 07:02:24,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:24,274 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:24,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 07:02:24,274 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:24,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1756685050, now seen corresponding path program 1 times [2023-11-29 07:02:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580106111] [2023-11-29 07:02:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:02:24,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:02:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:02:24,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:02:24,459 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:02:24,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 07:02:24,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 07:02:24,463 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:24,466 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:02:24,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 07:02:24,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 07:02:24,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 07:02:24,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 07:02:24,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-29 07:02:24,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 07:02:24,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 07:02:24,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated [2023-11-29 07:02:24,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated [2023-11-29 07:02:24,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:02:24 BoogieIcfgContainer [2023-11-29 07:02:24,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:02:24,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:02:24,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:02:24,570 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:02:24,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:58" (3/4) ... [2023-11-29 07:02:24,572 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:02:24,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:02:24,574 INFO L158 Benchmark]: Toolchain (without parser) took 27247.05ms. Allocated memory was 176.2MB in the beginning and 406.8MB in the end (delta: 230.7MB). Free memory was 135.3MB in the beginning and 329.0MB in the end (delta: -193.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,574 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 141.8MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:24,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.36ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 119.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.68ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 114.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,575 INFO L158 Benchmark]: Boogie Preprocessor took 72.07ms. Allocated memory is still 176.2MB. Free memory was 114.4MB in the beginning and 108.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,575 INFO L158 Benchmark]: RCFGBuilder took 625.09ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 108.0MB in the beginning and 199.8MB in the end (delta: -91.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,576 INFO L158 Benchmark]: TraceAbstraction took 26154.97ms. Allocated memory was 232.8MB in the beginning and 406.8MB in the end (delta: 174.1MB). Free memory was 198.8MB in the beginning and 329.0MB in the end (delta: -130.2MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. [2023-11-29 07:02:24,576 INFO L158 Benchmark]: Witness Printer took 3.57ms. Allocated memory is still 406.8MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:24,578 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.20ms. Allocated memory is still 176.2MB. Free memory was 141.8MB in the beginning and 141.8MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.36ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 119.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.68ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 114.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.07ms. Allocated memory is still 176.2MB. Free memory was 114.4MB in the beginning and 108.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 625.09ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 108.0MB in the beginning and 199.8MB in the end (delta: -91.8MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 26154.97ms. Allocated memory was 232.8MB in the beginning and 406.8MB in the end (delta: 174.1MB). Free memory was 198.8MB in the beginning and 329.0MB in the end (delta: -130.2MB). Peak memory consumption was 245.3MB. Max. memory is 16.1GB. * Witness Printer took 3.57ms. Allocated memory is still 406.8MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet23 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of shiftRight at line 182, overapproximation of someBinaryArithmeticDOUBLEoperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L65] COND FALSE !(\read(var_1_7)) [L68] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L70] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L73] var_1_32 = var_1_16 [L74] var_1_30 = var_1_32 [L75] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L77] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=16, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L79] COND TRUE var_1_11 >= var_1_30 [L80] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L82] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=64, var_1_22=506, var_1_24=10, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L82] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L83] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=10, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L91] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=10, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L92] COND TRUE ! var_1_7 [L93] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] EXPR var_1_15 ^ var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] COND TRUE (var_1_15 ^ var_1_1) < (var_1_13 | var_1_13) [L102] var_1_33 = ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L106] COND FALSE !((-32 & var_1_16) > var_1_32) [L109] var_1_40 = (var_1_18 + var_1_18) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L111] COND FALSE !(var_1_21 >= ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND TRUE var_1_21 <= (var_1_20 + var_1_19) [L119] var_1_45 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L122] COND FALSE !(var_1_18 > (var_1_19 + var_1_22)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] var_1_48 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L130] COND TRUE var_1_20 < var_1_22 [L131] var_1_49 = ((var_1_50 - var_1_51) + var_1_27) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, stepLocal_1=64, stepLocal_2=68, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L135] var_1_53 = var_1_11 [L136] var_1_54 = var_1_21 [L137] var_1_55 = var_1_11 [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=0, var_1_16=68, var_1_17=506, var_1_1=62, var_1_21=505, var_1_22=506, var_1_24=0, var_1_26=-3, var_1_27=-59, var_1_28=56, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_33=68, var_1_45=68, var_1_46=0, var_1_47=127, var_1_48=68, var_1_49=4, var_1_50=63, var_1_51=0, var_1_53=68, var_1_54=505, var_1_55=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 22, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3737 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3737 mSDsluCounter, 11178 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7649 mSDsCounter, 529 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4177 IncrementalHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 529 mSolverCounterUnsat, 3529 mSDtfsCounter, 4177 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1167 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=993occurred in iteration=21, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 3591 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 3412 NumberOfCodeBlocks, 3412 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3235 ConstructedInterpolants, 0 QuantifiedInterpolants, 16298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 19404/19404 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 07:02:24,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/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_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/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 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:02:26,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:02:26,610 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:02:26,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:02:26,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:02:26,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:02:26,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:02:26,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:02:26,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:02:26,655 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:02:26,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:02:26,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:02:26,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:02:26,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:02:26,659 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:02:26,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:02:26,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:02:26,661 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:02:26,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:02:26,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:02:26,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:02:26,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:02:26,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:02:26,665 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:02:26,665 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:02:26,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:02:26,666 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:02:26,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:02:26,667 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:02:26,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:02:26,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:02:26,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:02:26,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:02:26,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:26,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:02:26,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:02:26,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:02:26,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:02:26,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:02:26,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:02:26,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:02:26,671 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:02:26,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:02:26,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:02:26,672 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:02:26,672 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_56fe4ade-2943-48bf-83d9-504b262f737f/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_56fe4ade-2943-48bf-83d9-504b262f737f/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 -> 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e [2023-11-29 07:02:26,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:02:27,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:02:27,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:02:27,013 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:02:27,014 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:02:27,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:02:29,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:02:30,111 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:02:30,112 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:02:30,125 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/2d5b0c3fd/3394f46b15404d7d822a98eca9bfc4bf/FLAGb33fa6828 [2023-11-29 07:02:30,143 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/data/2d5b0c3fd/3394f46b15404d7d822a98eca9bfc4bf [2023-11-29 07:02:30,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:02:30,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:02:30,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:30,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:02:30,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:02:30,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f24ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30, skipping insertion in model container [2023-11-29 07:02:30,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,201 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:02:30,389 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_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2023-11-29 07:02:30,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:30,486 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:02:30,501 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_56fe4ade-2943-48bf-83d9-504b262f737f/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2023-11-29 07:02:30,541 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:30,563 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:02:30,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30 WrapperNode [2023-11-29 07:02:30,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:30,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:30,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:02:30,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:02:30,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,626 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2023-11-29 07:02:30,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:30,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:02:30,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:02:30,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:02:30,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,664 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 07:02:30,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:02:30,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:02:30,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:02:30,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:02:30,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (1/1) ... [2023-11-29 07:02:30,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:30,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:02:30,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:02:30,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:02:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:02:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:02:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:02:30,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:02:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:02:30,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:02:30,872 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:02:30,874 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:02:38,802 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:02:38,874 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:02:38,875 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:02:38,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:38 BoogieIcfgContainer [2023-11-29 07:02:38,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:02:38,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:02:38,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:02:38,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:02:38,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:02:30" (1/3) ... [2023-11-29 07:02:38,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f96d3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:38, skipping insertion in model container [2023-11-29 07:02:38,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:30" (2/3) ... [2023-11-29 07:02:38,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f96d3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:38, skipping insertion in model container [2023-11-29 07:02:38,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:38" (3/3) ... [2023-11-29 07:02:38,884 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2023-11-29 07:02:38,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:02:38,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:02:38,945 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:02:38,951 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;@4e0cd941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:02:38,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:02:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:02:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 07:02:38,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:38,973 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:38,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:38,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1385910112, now seen corresponding path program 1 times [2023-11-29 07:02:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048224435] [2023-11-29 07:02:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:38,993 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:38,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:38,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:39,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 07:02:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:39,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:02:39,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-11-29 07:02:39,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:39,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048224435] [2023-11-29 07:02:39,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048224435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67795921] [2023-11-29 07:02:39,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:39,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:02:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:02:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:02:39,812 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 07:02:44,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:02:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:44,009 INFO L93 Difference]: Finished difference Result 138 states and 244 transitions. [2023-11-29 07:02:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:02:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2023-11-29 07:02:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:44,058 INFO L225 Difference]: With dead ends: 138 [2023-11-29 07:02:44,058 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 07:02:44,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:02:44,066 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:44,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 07:02:44,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 07:02:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 07:02:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 07:02:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-11-29 07:02:44,114 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 146 [2023-11-29 07:02:44,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:44,115 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-11-29 07:02:44,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 07:02:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-11-29 07:02:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 07:02:44,120 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:44,121 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:44,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:44,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:44,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:44,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash -598721556, now seen corresponding path program 1 times [2023-11-29 07:02:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457920054] [2023-11-29 07:02:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:44,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:44,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:44,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:44,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:02:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:44,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 07:02:44,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:46,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:46,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457920054] [2023-11-29 07:02:46,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457920054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:46,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:46,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:02:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554901536] [2023-11-29 07:02:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:46,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:46,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:46,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:46,246 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:50,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:02:52,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:02:56,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:02:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:56,878 INFO L93 Difference]: Finished difference Result 203 states and 314 transitions. [2023-11-29 07:02:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:02:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 07:02:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:56,915 INFO L225 Difference]: With dead ends: 203 [2023-11-29 07:02:56,915 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 07:02:56,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 07:02:56,918 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 108 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 45 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:56,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 344 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2023-11-29 07:02:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 07:02:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2023-11-29 07:02:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 63 states have internal predecessors, (80), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:02:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 168 transitions. [2023-11-29 07:02:56,961 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 168 transitions. Word has length 146 [2023-11-29 07:02:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:56,963 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 168 transitions. [2023-11-29 07:02:56,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:02:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 168 transitions. [2023-11-29 07:02:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 07:02:56,967 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:56,967 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:56,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 07:02:57,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:57,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:57,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1416370006, now seen corresponding path program 1 times [2023-11-29 07:02:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575261347] [2023-11-29 07:02:57,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:02:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:57,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:02:57,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 07:02:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:57,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:02:57,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:02:57,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:57,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575261347] [2023-11-29 07:02:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575261347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709336161] [2023-11-29 07:02:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:57,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:57,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:57,865 INFO L87 Difference]: Start difference. First operand 110 states and 168 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:03:00,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:03:04,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:03:07,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:03:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:03:07,104 INFO L93 Difference]: Finished difference Result 200 states and 308 transitions. [2023-11-29 07:03:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:03:07,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 07:03:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:03:07,142 INFO L225 Difference]: With dead ends: 200 [2023-11-29 07:03:07,142 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 07:03:07,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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 07:03:07,144 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:03:07,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 191 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 07:03:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 07:03:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 118. [2023-11-29 07:03:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:03:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 179 transitions. [2023-11-29 07:03:07,175 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 179 transitions. Word has length 146 [2023-11-29 07:03:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:03:07,176 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 179 transitions. [2023-11-29 07:03:07,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:03:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 179 transitions. [2023-11-29 07:03:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 07:03:07,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:03:07,180 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:03:07,199 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 07:03:07,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:07,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:03:07,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:07,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1290249388, now seen corresponding path program 1 times [2023-11-29 07:03:07,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:07,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981411323] [2023-11-29 07:03:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:07,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:07,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:03:07,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 07:03:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:08,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 07:03:08,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-29 07:03:08,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:03:08,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:03:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981411323] [2023-11-29 07:03:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981411323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:03:08,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:03:08,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:03:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506156689] [2023-11-29 07:03:08,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:03:08,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:03:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:03:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:03:08,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:03:08,166 INFO L87 Difference]: Start difference. First operand 118 states and 179 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:03:12,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:03:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:03:12,606 INFO L93 Difference]: Finished difference Result 197 states and 297 transitions. [2023-11-29 07:03:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:03:12,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-11-29 07:03:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:03:12,610 INFO L225 Difference]: With dead ends: 197 [2023-11-29 07:03:12,610 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 07:03:12,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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 07:03:12,612 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 40 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:03:12,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 07:03:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 07:03:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-29 07:03:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 07:03:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2023-11-29 07:03:12,645 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 146 [2023-11-29 07:03:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:03:12,646 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2023-11-29 07:03:12,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-11-29 07:03:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2023-11-29 07:03:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 07:03:12,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:03:12,651 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:03:12,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 07:03:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:12,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:03:12,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1970307758, now seen corresponding path program 1 times [2023-11-29 07:03:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:12,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855652863] [2023-11-29 07:03:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:12,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:03:12,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:12,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 07:03:12,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_56fe4ade-2943-48bf-83d9-504b262f737f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 07:03:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:13,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 07:03:13,584 INFO L285 TraceCheckSpWp]: Computing forward predicates...