./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --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 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 01:46:44,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:46:44,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:46:44,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:46:44,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:46:44,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:46:44,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:46:44,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:46:44,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:46:44,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:46:44,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:46:44,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:46:44,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:46:44,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:46:44,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:46:44,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:46:44,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:46:44,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:46:44,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:46:44,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:46:44,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:46:44,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:46:44,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:46:44,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:46:44,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:46:44,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:46:44,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:46:44,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:46:44,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:46:44,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:46:44,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:46:45,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:46:45,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:46:45,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:46:45,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:46:45,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:46:45,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:46:45,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:46:45,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:46:45,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:46:45,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:46:45,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 01:46:45,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:46:45,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:46:45,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:46:45,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:46:45,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 01:46:45,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 01:46:45,049 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:46:45,049 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:46:45,049 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:46:45,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:46:45,050 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:46:45,050 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:46:45,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:46:45,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:46:45,052 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:46:45,052 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 01:46:45,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:46:45,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:46:45,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 01:46:45,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:46:45,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:46:45,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 01:46:45,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 01:46:45,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:46:45,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 01:46:45,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 01:46:45,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 01:46:45,055 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 01:46:45,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 01:46:45,055 INFO L138 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_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/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_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2022-11-23 01:46:45,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:46:45,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:46:45,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:46:45,343 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:46:45,343 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:46:45,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-11-23 01:46:48,164 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:46:48,386 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:46:48,387 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2022-11-23 01:46:48,395 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/data/953dc6a6c/b6cec6a3635e46889e7d8881b86a8a6e/FLAG6ef3d3c99 [2022-11-23 01:46:48,411 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/data/953dc6a6c/b6cec6a3635e46889e7d8881b86a8a6e [2022-11-23 01:46:48,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:46:48,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:46:48,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:46:48,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:46:48,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:46:48,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a1ea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48, skipping insertion in model container [2022-11-23 01:46:48,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:46:48,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:46:48,626 WARN L237 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_fcee13f1-c562-4526-ab5e-ade747f62616/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2022-11-23 01:46:48,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:46:48,659 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:46:48,670 WARN L237 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_fcee13f1-c562-4526-ab5e-ade747f62616/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2022-11-23 01:46:48,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:46:48,689 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:46:48,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48 WrapperNode [2022-11-23 01:46:48,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:46:48,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:46:48,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:46:48,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:46:48,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,720 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 79 [2022-11-23 01:46:48,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:46:48,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:46:48,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:46:48,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:46:48,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,738 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:46:48,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:46:48,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:46:48,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:46:48,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (1/1) ... [2022-11-23 01:46:48,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 01:46:48,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:46:48,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 01:46:48,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 01:46:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:46:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:46:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:46:48,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:46:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-23 01:46:48,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-23 01:46:48,883 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:46:48,885 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:46:49,032 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:46:49,041 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:46:49,041 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-23 01:46:49,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:49 BoogieIcfgContainer [2022-11-23 01:46:49,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:46:49,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 01:46:49,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 01:46:49,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 01:46:49,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:46:48" (1/3) ... [2022-11-23 01:46:49,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4176d3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:46:49, skipping insertion in model container [2022-11-23 01:46:49,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:46:48" (2/3) ... [2022-11-23 01:46:49,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4176d3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:46:49, skipping insertion in model container [2022-11-23 01:46:49,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:49" (3/3) ... [2022-11-23 01:46:49,061 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2022-11-23 01:46:49,080 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 01:46:49,080 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 01:46:49,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 01:46:49,158 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@1100bf9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 01:46:49,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 01:46:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-23 01:46:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 01:46:49,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:49,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:49,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -667640892, now seen corresponding path program 1 times [2022-11-23 01:46:49,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:49,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789030436] [2022-11-23 01:46:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:49,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:49,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:49,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789030436] [2022-11-23 01:46:49,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789030436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:49,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:49,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:46:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59656634] [2022-11-23 01:46:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:46:49,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:46:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:46:49,623 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:49,828 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2022-11-23 01:46:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:46:49,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 01:46:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:49,837 INFO L225 Difference]: With dead ends: 79 [2022-11-23 01:46:49,838 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 01:46:49,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:49,844 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:49,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 141 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 01:46:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-11-23 01:46:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-23 01:46:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2022-11-23 01:46:49,922 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 10 [2022-11-23 01:46:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:49,923 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2022-11-23 01:46:49,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2022-11-23 01:46:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 01:46:49,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:49,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:49,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 01:46:49,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -689596859, now seen corresponding path program 1 times [2022-11-23 01:46:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970059423] [2022-11-23 01:46:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:50,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:50,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970059423] [2022-11-23 01:46:50,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970059423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:50,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:50,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:46:50,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178536610] [2022-11-23 01:46:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:46:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:46:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:46:50,073 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:50,160 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-11-23 01:46:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:46:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 01:46:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:50,163 INFO L225 Difference]: With dead ends: 53 [2022-11-23 01:46:50,163 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 01:46:50,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:50,165 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:50,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 166 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:50,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 01:46:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-11-23 01:46:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2022-11-23 01:46:50,179 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 10 [2022-11-23 01:46:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:50,179 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2022-11-23 01:46:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2022-11-23 01:46:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 01:46:50,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:50,181 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:50,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 01:46:50,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 214778336, now seen corresponding path program 1 times [2022-11-23 01:46:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:50,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60640098] [2022-11-23 01:46:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:46:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:50,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60640098] [2022-11-23 01:46:50,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60640098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:50,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:50,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:46:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633482661] [2022-11-23 01:46:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:50,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:46:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:50,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:46:50,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:46:50,330 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 01:46:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:50,493 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-11-23 01:46:50,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:46:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-23 01:46:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:50,497 INFO L225 Difference]: With dead ends: 53 [2022-11-23 01:46:50,498 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 01:46:50,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:50,502 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:50,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 01:46:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-23 01:46:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2022-11-23 01:46:50,517 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 15 [2022-11-23 01:46:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:50,517 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-11-23 01:46:50,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 01:46:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2022-11-23 01:46:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 01:46:50,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:50,519 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:50,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 01:46:50,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1804674308, now seen corresponding path program 1 times [2022-11-23 01:46:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:50,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869444632] [2022-11-23 01:46:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 01:46:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 01:46:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:50,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869444632] [2022-11-23 01:46:50,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869444632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:50,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:50,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:46:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837666020] [2022-11-23 01:46:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:50,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:46:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:46:50,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:50,715 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 01:46:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:50,870 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-11-23 01:46:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:46:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-23 01:46:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:50,873 INFO L225 Difference]: With dead ends: 57 [2022-11-23 01:46:50,873 INFO L226 Difference]: Without dead ends: 55 [2022-11-23 01:46:50,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:46:50,884 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:50,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 144 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-23 01:46:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-23 01:46:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-11-23 01:46:50,897 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2022-11-23 01:46:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:50,897 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-11-23 01:46:50,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 01:46:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-11-23 01:46:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 01:46:50,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:50,902 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:50,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 01:46:50,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1749987360, now seen corresponding path program 1 times [2022-11-23 01:46:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:50,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559049479] [2022-11-23 01:46:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 01:46:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-23 01:46:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 01:46:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:51,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559049479] [2022-11-23 01:46:51,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559049479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:51,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:51,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:46:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399948355] [2022-11-23 01:46:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:51,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 01:46:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:51,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:46:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:46:51,048 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 01:46:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:51,134 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2022-11-23 01:46:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:46:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-11-23 01:46:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:51,141 INFO L225 Difference]: With dead ends: 62 [2022-11-23 01:46:51,141 INFO L226 Difference]: Without dead ends: 60 [2022-11-23 01:46:51,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:51,142 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:51,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-23 01:46:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-11-23 01:46:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-11-23 01:46:51,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 25 [2022-11-23 01:46:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:51,160 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-11-23 01:46:51,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-23 01:46:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-11-23 01:46:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 01:46:51,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:51,162 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:51,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 01:46:51,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash 158999923, now seen corresponding path program 1 times [2022-11-23 01:46:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341107613] [2022-11-23 01:46:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 01:46:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 01:46:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 01:46:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-23 01:46:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 01:46:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,291 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-23 01:46:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:51,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341107613] [2022-11-23 01:46:51,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341107613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:51,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:51,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 01:46:51,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906842958] [2022-11-23 01:46:51,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:51,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 01:46:51,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:51,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 01:46:51,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 01:46:51,295 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 01:46:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:51,421 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-11-23 01:46:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 01:46:51,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-11-23 01:46:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:51,423 INFO L225 Difference]: With dead ends: 71 [2022-11-23 01:46:51,423 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 01:46:51,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:46:51,424 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:51,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 141 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 01:46:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-11-23 01:46:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-23 01:46:51,458 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 43 [2022-11-23 01:46:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:51,458 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-23 01:46:51,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-23 01:46:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-23 01:46:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-23 01:46:51,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:51,460 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:51,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 01:46:51,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1329631219, now seen corresponding path program 1 times [2022-11-23 01:46:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:51,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387346792] [2022-11-23 01:46:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 01:46:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 01:46:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 01:46:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-23 01:46:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 01:46:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-23 01:46:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-23 01:46:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-23 01:46:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:51,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387346792] [2022-11-23 01:46:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387346792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:51,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 01:46:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945050727] [2022-11-23 01:46:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 01:46:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 01:46:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 01:46:51,688 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 01:46:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:51,841 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-11-23 01:46:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 01:46:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2022-11-23 01:46:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:51,845 INFO L225 Difference]: With dead ends: 71 [2022-11-23 01:46:51,845 INFO L226 Difference]: Without dead ends: 69 [2022-11-23 01:46:51,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 01:46:51,846 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 23 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:51,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 139 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-23 01:46:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-11-23 01:46:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-23 01:46:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-11-23 01:46:51,876 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 53 [2022-11-23 01:46:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:51,876 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-11-23 01:46:51,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-23 01:46:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-11-23 01:46:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 01:46:51,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 01:46:51,883 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:51,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 01:46:51,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 01:46:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:46:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1418667265, now seen corresponding path program 1 times [2022-11-23 01:46:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:46:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112126436] [2022-11-23 01:46:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:46:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:46:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-23 01:46:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-23 01:46:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-23 01:46:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-23 01:46:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-23 01:46:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-23 01:46:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-23 01:46:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-23 01:46:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-23 01:46:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-23 01:46:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:46:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-11-23 01:46:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:46:52,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112126436] [2022-11-23 01:46:52,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112126436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:46:52,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:46:52,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 01:46:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755519535] [2022-11-23 01:46:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:46:52,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 01:46:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:46:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 01:46:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 01:46:52,045 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 01:46:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:46:52,217 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-11-23 01:46:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 01:46:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-11-23 01:46:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 01:46:52,218 INFO L225 Difference]: With dead ends: 69 [2022-11-23 01:46:52,219 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 01:46:52,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-23 01:46:52,220 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 01:46:52,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 148 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 01:46:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 01:46:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 01:46:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:46:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 01:46:52,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2022-11-23 01:46:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 01:46:52,222 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 01:46:52,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 01:46:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 01:46:52,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 01:46:52,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 01:46:52,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 01:46:52,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 01:46:52,559 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,559 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-11-23 01:46:52,559 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-23 01:46:52,559 INFO L895 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,560 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2022-11-23 01:46:52,560 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-23 01:46:52,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 01:46:52,561 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-23 01:46:52,561 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,561 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-11-23 01:46:52,561 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-11-23 01:46:52,561 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,561 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,561 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,561 INFO L902 garLoopResultBuilder]: At program point L66(lines 24 67) the Hoare annotation is: true [2022-11-23 01:46:52,562 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 01:46:52,562 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,562 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,562 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,562 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,562 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-11-23 01:46:52,562 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,562 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2022-11-23 01:46:52,563 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,563 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2022-11-23 01:46:52,563 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-23 01:46:52,563 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-11-23 01:46:52,564 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-23 01:46:52,564 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-23 01:46:52,564 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-23 01:46:52,564 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-23 01:46:52,564 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-23 01:46:52,565 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-23 01:46:52,568 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:46:52,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 01:46:52,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:46:52 BoogieIcfgContainer [2022-11-23 01:46:52,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 01:46:52,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 01:46:52,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 01:46:52,592 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 01:46:52,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:46:49" (3/4) ... [2022-11-23 01:46:52,595 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 01:46:52,601 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-23 01:46:52,605 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-23 01:46:52,605 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-23 01:46:52,605 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-23 01:46:52,606 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 01:46:52,643 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/witness.graphml [2022-11-23 01:46:52,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 01:46:52,643 INFO L158 Benchmark]: Toolchain (without parser) took 4229.74ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 126.6MB in the beginning and 153.6MB in the end (delta: -27.1MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,644 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:46:52,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.58ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 125.8MB in the end (delta: 744.6kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.91ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 124.1MB in the end (delta: 862.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 01:46:52,645 INFO L158 Benchmark]: Boogie Preprocessor took 19.91ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 122.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,645 INFO L158 Benchmark]: RCFGBuilder took 302.40ms. Allocated memory is still 159.4MB. Free memory was 122.8MB in the beginning and 110.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,645 INFO L158 Benchmark]: TraceAbstraction took 3541.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 109.5MB in the beginning and 156.8MB in the end (delta: -47.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,646 INFO L158 Benchmark]: Witness Printer took 51.84ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 153.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 01:46:52,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.58ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 125.8MB in the end (delta: 744.6kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.91ms. Allocated memory is still 159.4MB. Free memory was 125.0MB in the beginning and 124.1MB in the end (delta: 862.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.91ms. Allocated memory is still 159.4MB. Free memory was 124.1MB in the beginning and 122.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.40ms. Allocated memory is still 159.4MB. Free memory was 122.8MB in the beginning and 110.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3541.96ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 109.5MB in the beginning and 156.8MB in the end (delta: -47.3MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * Witness Printer took 51.84ms. Allocated memory is still 192.9MB. Free memory was 156.8MB in the beginning and 153.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 691 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 370 mSDtfsCounter, 691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 52 PreInvPairs, 74 NumberOfFragments, 365 HoareAnnotationTreeSize, 52 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! [2022-11-23 01:46:52,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcee13f1-c562-4526-ab5e-ade747f62616/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE