./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX --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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:54:39,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:54:39,813 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:54:39,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:54:39,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:54:39,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:54:39,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:54:39,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:54:39,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:54:39,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:54:39,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:54:39,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:54:39,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:54:39,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:54:39,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:54:39,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:54:39,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:54:39,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:54:39,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:54:39,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:54:39,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:54:39,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:54:39,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:54:39,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:54:39,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:54:39,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:54:39,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:54:39,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:54:39,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:54:39,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:54:39,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:54:39,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:54:39,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:54:39,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:54:39,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:54:39,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:54:39,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:54:39,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:54:39,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:54:39,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:54:39,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:54:39,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:54:39,872 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_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-11-08 17:54:40,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:54:40,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:54:40,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:54:40,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:54:40,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:54:40,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i Unable to find full path for "g++" [2024-11-08 17:54:42,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:54:42,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:54:42,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-08 17:54:43,000 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/cb3ef9373/2b7df4275d9944c5ba881e8a24184f3e/FLAG57d9d2017 [2024-11-08 17:54:43,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/cb3ef9373/2b7df4275d9944c5ba881e8a24184f3e [2024-11-08 17:54:43,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:54:43,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:54:43,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:54:43,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:54:43,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:54:43,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2215bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43, skipping insertion in model container [2024-11-08 17:54:43,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:54:43,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-08 17:54:43,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:54:43,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:54:43,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-08 17:54:43,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:54:43,570 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:54:43,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43 WrapperNode [2024-11-08 17:54:43,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:54:43,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:54:43,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:54:43,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:54:43,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,669 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-08 17:54:43,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:54:43,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:54:43,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:54:43,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:54:43,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:54:43,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:54:43,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:54:43,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:54:43,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:54:43,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (1/1) ... [2024-11-08 17:54:43,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:54:43,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:54:43,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:54:43,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:54:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:54:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:54:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:54:43,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:54:43,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:54:43,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:54:44,012 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:54:44,017 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:54:44,660 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 17:54:44,661 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:54:44,687 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:54:44,687 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:54:44,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:44 BoogieIcfgContainer [2024-11-08 17:54:44,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:54:44,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:54:44,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:54:44,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:54:44,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:54:43" (1/3) ... [2024-11-08 17:54:44,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb6e05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:44, skipping insertion in model container [2024-11-08 17:54:44,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:54:43" (2/3) ... [2024-11-08 17:54:44,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb6e05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:54:44, skipping insertion in model container [2024-11-08 17:54:44,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:44" (3/3) ... [2024-11-08 17:54:44,703 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-08 17:54:44,726 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:54:44,727 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:54:44,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:54:44,819 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8da4823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:54:44,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:54:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:54:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:54:44,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:44,844 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:54:44,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:44,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 337415320, now seen corresponding path program 1 times [2024-11-08 17:54:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:54:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996626483] [2024-11-08 17:54:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:54:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:54:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:54:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:54:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:54:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:54:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:54:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:54:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:54:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:54:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:54:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:54:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:54:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:54:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:54:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:54:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:54:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:54:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996626483] [2024-11-08 17:54:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996626483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:54:45,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:54:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:54:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41061726] [2024-11-08 17:54:45,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:54:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:54:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:54:45,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:54:45,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:54:45,502 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:54:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:54:45,539 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2024-11-08 17:54:45,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:54:45,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-08 17:54:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:54:45,549 INFO L225 Difference]: With dead ends: 141 [2024-11-08 17:54:45,550 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 17:54:45,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:54:45,558 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:54:45,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:54:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 17:54:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 17:54:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:54:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-08 17:54:45,618 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 108 [2024-11-08 17:54:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:54:45,618 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-08 17:54:45,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 17:54:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-08 17:54:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:54:45,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:45,625 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:54:45,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:54:45,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:45,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash -796463022, now seen corresponding path program 1 times [2024-11-08 17:54:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:54:45,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255443034] [2024-11-08 17:54:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:45,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:54:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:54:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:45,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:54:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:54:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:54:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:54:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:54:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:54:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:54:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:54:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:54:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:54:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:54:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:54:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:54:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:54:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:54:46,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:54:46,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255443034] [2024-11-08 17:54:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255443034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:54:46,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:54:46,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:54:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588361547] [2024-11-08 17:54:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:54:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:54:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:54:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:54:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:54:46,172 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:54:46,229 INFO L93 Difference]: Finished difference Result 138 states and 203 transitions. [2024-11-08 17:54:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:54:46,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-08 17:54:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:54:46,232 INFO L225 Difference]: With dead ends: 138 [2024-11-08 17:54:46,232 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 17:54:46,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:54:46,234 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:54:46,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:54:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 17:54:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 17:54:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:54:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-08 17:54:46,246 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-08 17:54:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:54:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-08 17:54:46,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-08 17:54:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:54:46,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:46,255 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:54:46,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:54:46,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1142314634, now seen corresponding path program 1 times [2024-11-08 17:54:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:54:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981896052] [2024-11-08 17:54:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:54:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:54:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:54:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:54:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:54:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:54:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:54:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:54:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:54:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:54:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:54:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:54:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:54:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:54:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:54:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:50,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:54:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:54:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:54:50,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981896052] [2024-11-08 17:54:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981896052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:54:50,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:54:50,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:54:50,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009551866] [2024-11-08 17:54:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:54:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:54:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:54:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:54:50,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:54:50,020 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:54:50,733 INFO L93 Difference]: Finished difference Result 179 states and 260 transitions. [2024-11-08 17:54:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:54:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-08 17:54:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:54:50,736 INFO L225 Difference]: With dead ends: 179 [2024-11-08 17:54:50,737 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 17:54:50,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:54:50,739 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 167 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:54:50,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 316 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:54:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 17:54:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2024-11-08 17:54:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:54:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-11-08 17:54:50,765 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 109 [2024-11-08 17:54:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:54:50,765 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-11-08 17:54:50,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-11-08 17:54:50,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:54:50,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:50,773 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:54:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:54:50,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash -546629108, now seen corresponding path program 1 times [2024-11-08 17:54:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:54:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081710441] [2024-11-08 17:54:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:54:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:54:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:54:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:54:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:54:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:54:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:54:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:54:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:54:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:54:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:54:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:54:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:54:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:54:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:54:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:54:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:54:54,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:54:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081710441] [2024-11-08 17:54:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081710441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:54:54,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:54:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:54:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001367592] [2024-11-08 17:54:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:54:54,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:54:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:54:54,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:54:54,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:54:54,826 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:54:57,561 INFO L93 Difference]: Finished difference Result 267 states and 391 transitions. [2024-11-08 17:54:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:54:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-08 17:54:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:54:57,564 INFO L225 Difference]: With dead ends: 267 [2024-11-08 17:54:57,565 INFO L226 Difference]: Without dead ends: 175 [2024-11-08 17:54:57,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:54:57,571 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:54:57,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 452 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 17:54:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-08 17:54:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2024-11-08 17:54:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.4125) internal successors, (113), 80 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:54:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2024-11-08 17:54:57,601 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 109 [2024-11-08 17:54:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:54:57,603 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2024-11-08 17:54:57,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:54:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2024-11-08 17:54:57,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:54:57,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:54:57,611 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:54:57,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:54:57,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:54:57,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:54:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash -123927282, now seen corresponding path program 1 times [2024-11-08 17:54:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:54:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579692407] [2024-11-08 17:54:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:54:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:54:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:54:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:54:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:54:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:54:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:54:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:54:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:54:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:54:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:54:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:54:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:54:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:54:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:54:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:54:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:54:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:54:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:54:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:54:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579692407] [2024-11-08 17:54:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579692407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:54:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:54:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:54:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541951649] [2024-11-08 17:54:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:54:59,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:54:59,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:54:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:54:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:54:59,507 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:00,717 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-11-08 17:55:00,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:55:00,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-08 17:55:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:00,720 INFO L225 Difference]: With dead ends: 233 [2024-11-08 17:55:00,721 INFO L226 Difference]: Without dead ends: 139 [2024-11-08 17:55:00,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:55:00,726 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 93 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:00,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 447 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:55:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-08 17:55:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 73. [2024-11-08 17:55:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2024-11-08 17:55:00,743 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 109 [2024-11-08 17:55:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:00,748 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2024-11-08 17:55:00,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2024-11-08 17:55:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:55:00,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:00,753 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:00,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:55:00,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:00,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1999248645, now seen corresponding path program 1 times [2024-11-08 17:55:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634950803] [2024-11-08 17:55:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:00,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,097 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 17:55:01,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634950803] [2024-11-08 17:55:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634950803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:55:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434748561] [2024-11-08 17:55:01,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:01,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:55:01,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:55:01,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:55:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:01,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:55:01,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 17:55:01,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:55:01,969 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 17:55:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434748561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:55:01,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:55:01,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 17:55:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909513503] [2024-11-08 17:55:01,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:55:01,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:55:01,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:55:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:55:01,974 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-08 17:55:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:02,256 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-08 17:55:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:55:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111 [2024-11-08 17:55:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:02,258 INFO L225 Difference]: With dead ends: 153 [2024-11-08 17:55:02,259 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 17:55:02,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:55:02,261 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:02,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 174 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:55:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 17:55:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-08 17:55:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-11-08 17:55:02,273 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 111 [2024-11-08 17:55:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:02,274 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-11-08 17:55:02,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-08 17:55:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-11-08 17:55:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:55:02,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:02,276 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:02,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:55:02,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:02,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 5103939, now seen corresponding path program 1 times [2024-11-08 17:55:02,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:02,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138420148] [2024-11-08 17:55:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:55:02,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122944961] [2024-11-08 17:55:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:55:02,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:55:02,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:55:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:03,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:55:03,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-08 17:55:03,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:55:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 17:55:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138420148] [2024-11-08 17:55:04,089 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 17:55:04,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122944961] [2024-11-08 17:55:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122944961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:55:04,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:55:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-08 17:55:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455315040] [2024-11-08 17:55:04,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:55:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:55:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:55:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:55:04,093 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 17:55:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:05,428 INFO L93 Difference]: Finished difference Result 251 states and 330 transitions. [2024-11-08 17:55:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:55:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-08 17:55:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:05,431 INFO L225 Difference]: With dead ends: 251 [2024-11-08 17:55:05,432 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 17:55:05,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:55:05,434 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 209 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:05,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 711 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:55:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 17:55:05,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2024-11-08 17:55:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2024-11-08 17:55:05,451 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 111 [2024-11-08 17:55:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2024-11-08 17:55:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-08 17:55:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2024-11-08 17:55:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:55:05,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:05,455 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:05,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:55:05,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 17:55:05,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:05,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash -425874086, now seen corresponding path program 1 times [2024-11-08 17:55:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:05,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194497496] [2024-11-08 17:55:05,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:05,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:05,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:05,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:05,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194497496] [2024-11-08 17:55:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194497496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:05,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:05,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:55:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007919955] [2024-11-08 17:55:05,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:05,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:55:05,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:05,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:55:05,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:55:05,821 INFO L87 Difference]: Start difference. First operand 120 states and 162 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:05,898 INFO L93 Difference]: Finished difference Result 288 states and 385 transitions. [2024-11-08 17:55:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:55:05,899 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-08 17:55:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:05,902 INFO L225 Difference]: With dead ends: 288 [2024-11-08 17:55:05,902 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 17:55:05,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:55:05,906 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:05,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:55:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 17:55:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120. [2024-11-08 17:55:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2024-11-08 17:55:05,938 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 111 [2024-11-08 17:55:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2024-11-08 17:55:05,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2024-11-08 17:55:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:55:05,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:05,943 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:05,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:55:05,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:05,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -124108806, now seen corresponding path program 1 times [2024-11-08 17:55:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:05,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215527020] [2024-11-08 17:55:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215527020] [2024-11-08 17:55:07,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215527020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:07,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:07,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:55:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252965451] [2024-11-08 17:55:07,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:07,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:55:07,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:07,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:55:07,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:55:07,441 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:08,308 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2024-11-08 17:55:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:55:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-08 17:55:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:08,312 INFO L225 Difference]: With dead ends: 479 [2024-11-08 17:55:08,312 INFO L226 Difference]: Without dead ends: 362 [2024-11-08 17:55:08,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:55:08,314 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 202 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:08,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 530 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 17:55:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-08 17:55:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 239. [2024-11-08 17:55:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.3235294117647058) internal successors, (270), 205 states have internal predecessors, (270), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:55:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 322 transitions. [2024-11-08 17:55:08,346 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 322 transitions. Word has length 111 [2024-11-08 17:55:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:08,347 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 322 transitions. [2024-11-08 17:55:08,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 322 transitions. [2024-11-08 17:55:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 17:55:08,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:08,349 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:55:08,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 298593020, now seen corresponding path program 1 times [2024-11-08 17:55:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092473096] [2024-11-08 17:55:08,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:08,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092473096] [2024-11-08 17:55:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092473096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:55:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862003975] [2024-11-08 17:55:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:55:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:55:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:55:08,958 INFO L87 Difference]: Start difference. First operand 239 states and 322 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:09,658 INFO L93 Difference]: Finished difference Result 695 states and 916 transitions. [2024-11-08 17:55:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:55:09,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-08 17:55:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:09,663 INFO L225 Difference]: With dead ends: 695 [2024-11-08 17:55:09,664 INFO L226 Difference]: Without dead ends: 459 [2024-11-08 17:55:09,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:55:09,666 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 139 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:09,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 481 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:55:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-08 17:55:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 246. [2024-11-08 17:55:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 211 states have (on average 1.3270142180094786) internal successors, (280), 212 states have internal predecessors, (280), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:55:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 332 transitions. [2024-11-08 17:55:09,715 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 332 transitions. Word has length 111 [2024-11-08 17:55:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:09,716 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 332 transitions. [2024-11-08 17:55:09,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 332 transitions. [2024-11-08 17:55:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:55:09,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:09,719 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:09,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:55:09,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 161442966, now seen corresponding path program 1 times [2024-11-08 17:55:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252406207] [2024-11-08 17:55:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252406207] [2024-11-08 17:55:14,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252406207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:14,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:14,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 17:55:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655421826] [2024-11-08 17:55:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:14,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 17:55:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 17:55:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:55:14,567 INFO L87 Difference]: Start difference. First operand 246 states and 332 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:20,312 INFO L93 Difference]: Finished difference Result 562 states and 749 transitions. [2024-11-08 17:55:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-08 17:55:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 17:55:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:20,315 INFO L225 Difference]: With dead ends: 562 [2024-11-08 17:55:20,316 INFO L226 Difference]: Without dead ends: 319 [2024-11-08 17:55:20,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:55:20,318 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 223 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:20,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 900 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:55:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-08 17:55:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 276. [2024-11-08 17:55:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 242 states have internal predecessors, (321), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:55:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 373 transitions. [2024-11-08 17:55:20,351 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 373 transitions. Word has length 112 [2024-11-08 17:55:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:20,352 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 373 transitions. [2024-11-08 17:55:20,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 373 transitions. [2024-11-08 17:55:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:55:20,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:20,355 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:55:20,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 463208246, now seen corresponding path program 1 times [2024-11-08 17:55:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333338801] [2024-11-08 17:55:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:20,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333338801] [2024-11-08 17:55:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333338801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:55:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143271210] [2024-11-08 17:55:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:20,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:55:20,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:55:20,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:55:20,885 INFO L87 Difference]: Start difference. First operand 276 states and 373 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:21,497 INFO L93 Difference]: Finished difference Result 711 states and 944 transitions. [2024-11-08 17:55:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:55:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 17:55:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:21,502 INFO L225 Difference]: With dead ends: 711 [2024-11-08 17:55:21,502 INFO L226 Difference]: Without dead ends: 438 [2024-11-08 17:55:21,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:55:21,504 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 77 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:21,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 568 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:55:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-08 17:55:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 298. [2024-11-08 17:55:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 263 states have (on average 1.326996197718631) internal successors, (349), 264 states have internal predecessors, (349), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:55:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 401 transitions. [2024-11-08 17:55:21,539 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 401 transitions. Word has length 112 [2024-11-08 17:55:21,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:21,540 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 401 transitions. [2024-11-08 17:55:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 401 transitions. [2024-11-08 17:55:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:55:21,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:21,543 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:21,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:55:21,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:21,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -986111170, now seen corresponding path program 1 times [2024-11-08 17:55:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364322092] [2024-11-08 17:55:21,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:55:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:55:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 17:55:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 17:55:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:55:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 17:55:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 17:55:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:55:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:55:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 17:55:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 17:55:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:55:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:55:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:55:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 17:55:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:55:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364322092] [2024-11-08 17:55:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364322092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:55:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996998759] [2024-11-08 17:55:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:55:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:55:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:55:21,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:55:21,666 INFO L87 Difference]: Start difference. First operand 298 states and 401 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:21,775 INFO L93 Difference]: Finished difference Result 675 states and 910 transitions. [2024-11-08 17:55:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:55:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 17:55:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:21,779 INFO L225 Difference]: With dead ends: 675 [2024-11-08 17:55:21,779 INFO L226 Difference]: Without dead ends: 380 [2024-11-08 17:55:21,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:55:21,781 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:21,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 168 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:55:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-08 17:55:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 304. [2024-11-08 17:55:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 270 states have internal predecessors, (356), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 17:55:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 408 transitions. [2024-11-08 17:55:21,816 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 408 transitions. Word has length 112 [2024-11-08 17:55:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:21,817 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 408 transitions. [2024-11-08 17:55:21,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:21,818 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 408 transitions. [2024-11-08 17:55:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 17:55:21,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:21,820 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:55:21,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1396797839, now seen corresponding path program 1 times [2024-11-08 17:55:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:55:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524288530] [2024-11-08 17:55:21,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:55:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:55:21,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008268538] [2024-11-08 17:55:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:55:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:55:21,903 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:55:21,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:55:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:55:22,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:55:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:55:22,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:55:22,974 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:55:22,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:55:22,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 17:55:23,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 17:55:23,185 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:23,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:55:23,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:55:23 BoogieIcfgContainer [2024-11-08 17:55:23,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:55:23,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:55:23,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:55:23,315 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:55:23,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:54:44" (3/4) ... [2024-11-08 17:55:23,322 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:55:23,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:55:23,324 INFO L158 Benchmark]: Toolchain (without parser) took 40301.86ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 126.8MB in the beginning and 142.5MB in the end (delta: -15.7MB). Peak memory consumption was 231.7MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,325 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 109.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:55:23,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.75ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 111.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.29ms. Allocated memory is still 159.4MB. Free memory was 110.7MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,326 INFO L158 Benchmark]: Boogie Preprocessor took 96.61ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 104.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,327 INFO L158 Benchmark]: RCFGBuilder took 916.78ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 115.4MB in the end (delta: -10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,327 INFO L158 Benchmark]: TraceAbstraction took 38617.65ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 115.4MB in the beginning and 142.5MB in the end (delta: -27.1MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. [2024-11-08 17:55:23,328 INFO L158 Benchmark]: Witness Printer took 13.19ms. Allocated memory is still 406.8MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:55:23,330 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.36ms. Allocated memory is still 109.1MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.75ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 111.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.29ms. Allocated memory is still 159.4MB. Free memory was 110.7MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.61ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 104.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 916.78ms. Allocated memory is still 159.4MB. Free memory was 104.8MB in the beginning and 115.4MB in the end (delta: -10.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38617.65ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 115.4MB in the beginning and 142.5MB in the end (delta: -27.1MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. * Witness Printer took 13.19ms. Allocated memory is still 406.8MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L127] RET updateVariables() [L128] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=6, var_1_13=6, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.4s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1372 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1366 mSDsluCounter, 5238 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3836 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3291 IncrementalHoareTripleChecker+Invalid, 3335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 1402 mSDtfsCounter, 3291 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 942 GetRequests, 833 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=13, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 861 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 1880 NumberOfCodeBlocks, 1880 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1751 ConstructedInterpolants, 0 QuantifiedInterpolants, 7086 SizeOfPredicates, 9 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 6534/6720 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 [2024-11-08 17:55:23,407 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX --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 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:55:26,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:55:26,408 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:55:26,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:55:26,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:55:26,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:55:26,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:55:26,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:55:26,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:55:26,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:55:26,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:55:26,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:55:26,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:55:26,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:55:26,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:55:26,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:55:26,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:55:26,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:55:26,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:55:26,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:55:26,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:55:26,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:55:26,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:55:26,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:55:26,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:55:26,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:55:26,498 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:55:26,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:55:26,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:55:26,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:55:26,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:55:26,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:55:26,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:55:26,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:55:26,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:55:26,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:55:26,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:55:26,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:55:26,507 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:55:26,508 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:55:26,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:55:26,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:55:26,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:55:26,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:55:26,510 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_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX 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 -> 3eb5b7aaef172dee0e37bd16c0d6ef7d510ec65ffc3ca19114c477e13a1d6fd1 [2024-11-08 17:55:26,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:55:27,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:55:27,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:55:27,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:55:27,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:55:27,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i Unable to find full path for "g++" [2024-11-08 17:55:29,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:55:29,941 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:55:29,942 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-08 17:55:29,955 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/32673888e/96a5c53152b54c72a274045a1d617630/FLAG10614fb0a [2024-11-08 17:55:30,277 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/data/32673888e/96a5c53152b54c72a274045a1d617630 [2024-11-08 17:55:30,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:55:30,284 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:55:30,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:55:30,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:55:30,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:55:30,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:30,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19748e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30, skipping insertion in model container [2024-11-08 17:55:30,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:30,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:55:30,655 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-08 17:55:30,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:55:30,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:55:30,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-9.i[914,927] [2024-11-08 17:55:30,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:55:30,895 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:55:30,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30 WrapperNode [2024-11-08 17:55:30,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:55:30,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:55:30,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:55:30,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:55:30,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:30,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:30,982 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-08 17:55:30,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:55:30,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:55:30,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:55:30,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:55:31,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,035 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:55:31,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,078 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:55:31,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:55:31,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:55:31,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:55:31,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (1/1) ... [2024-11-08 17:55:31,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:55:31,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:55:31,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:55:31,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:55:31,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:55:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:55:31,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:55:31,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:55:31,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:55:31,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:55:31,314 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:55:31,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:55:31,844 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 17:55:31,844 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:55:31,867 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:55:31,867 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:55:31,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:55:31 BoogieIcfgContainer [2024-11-08 17:55:31,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:55:31,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:55:31,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:55:31,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:55:31,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:55:30" (1/3) ... [2024-11-08 17:55:31,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a0c87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:55:31, skipping insertion in model container [2024-11-08 17:55:31,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:55:30" (2/3) ... [2024-11-08 17:55:31,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a0c87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:55:31, skipping insertion in model container [2024-11-08 17:55:31,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:55:31" (3/3) ... [2024-11-08 17:55:31,887 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-9.i [2024-11-08 17:55:31,910 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:55:31,910 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:55:31,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:55:31,990 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fcfc5f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:55:31,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:55:31,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 17:55:32,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:32,009 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:32,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:32,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2123019748, now seen corresponding path program 1 times [2024-11-08 17:55:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:55:32,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130304813] [2024-11-08 17:55:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:32,030 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 [2024-11-08 17:55:32,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:55:32,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:55:32,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:55:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:32,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:55:32,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:55:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 17:55:32,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:55:32,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:55:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130304813] [2024-11-08 17:55:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130304813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:55:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:55:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:55:32,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829708499] [2024-11-08 17:55:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:55:32,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:55:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:55:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:55:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:55:32,487 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:55:32,542 INFO L93 Difference]: Finished difference Result 103 states and 173 transitions. [2024-11-08 17:55:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:55:32,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-08 17:55:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:55:32,574 INFO L225 Difference]: With dead ends: 103 [2024-11-08 17:55:32,574 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 17:55:32,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:55:32,589 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:55:32,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:55:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 17:55:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 17:55:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 17:55:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-08 17:55:32,665 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2024-11-08 17:55:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:55:32,669 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-08 17:55:32,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 17:55:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-08 17:55:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 17:55:32,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:55:32,681 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:55:32,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 17:55:32,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:55:32,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:55:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:55:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash -793279383, now seen corresponding path program 1 times [2024-11-08 17:55:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:55:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215084210] [2024-11-08 17:55:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:55:32,888 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 [2024-11-08 17:55:32,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:55:32,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:55:32,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7879f33-d609-4d06-8f8d-83a3c10c9c9d/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:55:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:55:33,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 17:55:33,242 INFO L278 TraceCheckSpWp]: Computing forward predicates...