./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:15:11,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:15:11,658 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:15:11,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:15:11,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:15:11,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:15:11,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:15:11,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:15:11,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:15:11,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:15:11,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:15:11,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:15:11,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:15:11,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:15:11,708 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:15:11,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:15:11,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:15:11,710 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:15:11,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:15:11,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:15:11,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:15:11,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:15:11,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:15:11,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:15:11,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:15:11,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:15:11,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:15:11,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:15:11,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:15:11,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:15:11,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:15:11,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:15:11,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:11,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:15:11,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:15:11,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:15:11,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:15:11,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:15:11,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:15:11,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:15:11,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:15:11,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:15:11,726 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/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_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-10-31 22:15:12,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:15:12,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:15:12,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:15:12,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:15:12,071 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:15:12,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i Unable to find full path for "g++" [2024-10-31 22:15:14,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:15:14,609 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:15:14,611 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-10-31 22:15:14,625 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data/ce0e08337/64c82df65dea47e3821f09e016474078/FLAG079575616 [2024-10-31 22:15:14,640 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data/ce0e08337/64c82df65dea47e3821f09e016474078 [2024-10-31 22:15:14,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:15:14,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:15:14,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:14,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:15:14,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:15:14,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:14" (1/1) ... [2024-10-31 22:15:14,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d177c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:14, skipping insertion in model container [2024-10-31 22:15:14,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:15:14" (1/1) ... [2024-10-31 22:15:14,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:15:14,905 WARN L251 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_ca747881-41f9-404c-9907-e23cad3eb4cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-10-31 22:15:14,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:14,999 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:15:15,010 WARN L251 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_ca747881-41f9-404c-9907-e23cad3eb4cd/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-10-31 22:15:15,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:15:15,097 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:15:15,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15 WrapperNode [2024-10-31 22:15:15,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:15:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:15,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:15:15,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:15:15,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,128 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,178 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-31 22:15:15,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:15:15,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:15:15,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:15:15,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:15:15,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:15:15,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:15:15,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:15:15,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:15:15,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:15:15,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (1/1) ... [2024-10-31 22:15:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:15,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:15:15,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:15:15,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:15:15,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:15:15,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:15:15,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:15:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:15:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:15:15,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:15:15,434 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:15:15,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:15:15,983 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-31 22:15:15,984 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:15:16,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:15:16,004 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:15:16,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:16 BoogieIcfgContainer [2024-10-31 22:15:16,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:15:16,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:15:16,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:15:16,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:15:16,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:15:14" (1/3) ... [2024-10-31 22:15:16,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714025cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:16, skipping insertion in model container [2024-10-31 22:15:16,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:15:15" (2/3) ... [2024-10-31 22:15:16,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714025cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:15:16, skipping insertion in model container [2024-10-31 22:15:16,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:16" (3/3) ... [2024-10-31 22:15:16,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-10-31 22:15:16,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:15:16,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:15:16,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:15:16,112 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2883d1e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:15:16,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:15:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 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) [2024-10-31 22:15:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:15:16,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:16,143 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:16,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1316528595, now seen corresponding path program 1 times [2024-10-31 22:15:16,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011251125] [2024-10-31 22:15:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:16,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011251125] [2024-10-31 22:15:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011251125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:16,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:15:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154048167] [2024-10-31 22:15:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:16,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:15:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:15:16,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:15:16,689 INFO L87 Difference]: Start difference. First operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 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 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:15:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:16,730 INFO L93 Difference]: Finished difference Result 143 states and 227 transitions. [2024-10-31 22:15:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:15:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 116 [2024-10-31 22:15:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:16,743 INFO L225 Difference]: With dead ends: 143 [2024-10-31 22:15:16,744 INFO L226 Difference]: Without dead ends: 69 [2024-10-31 22:15:16,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:15:16,754 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:16,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:15:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-31 22:15:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-31 22:15:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 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) [2024-10-31 22:15:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2024-10-31 22:15:16,812 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 116 [2024-10-31 22:15:16,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:16,813 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2024-10-31 22:15:16,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-31 22:15:16,814 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2024-10-31 22:15:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:15:16,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:16,822 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:16,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:15:16,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:16,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:16,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1723712889, now seen corresponding path program 1 times [2024-10-31 22:15:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:16,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582111831] [2024-10-31 22:15:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:17,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:17,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582111831] [2024-10-31 22:15:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582111831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:17,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414052633] [2024-10-31 22:15:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:17,291 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:17,381 INFO L93 Difference]: Finished difference Result 166 states and 241 transitions. [2024-10-31 22:15:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-10-31 22:15:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:17,384 INFO L225 Difference]: With dead ends: 166 [2024-10-31 22:15:17,385 INFO L226 Difference]: Without dead ends: 100 [2024-10-31 22:15:17,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:17,387 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:17,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 202 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:15:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-31 22:15:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2024-10-31 22:15:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.359375) internal successors, (87), 64 states have internal predecessors, (87), 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) [2024-10-31 22:15:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-10-31 22:15:17,411 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 116 [2024-10-31 22:15:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:17,413 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-10-31 22:15:17,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-10-31 22:15:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:15:17,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:17,421 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:17,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:15:17,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1011238201, now seen corresponding path program 1 times [2024-10-31 22:15:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354037324] [2024-10-31 22:15:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354037324] [2024-10-31 22:15:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354037324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:15:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688508664] [2024-10-31 22:15:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:17,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:15:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:15:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:15:17,973 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:18,203 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-10-31 22:15:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:15:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-10-31 22:15:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:18,206 INFO L225 Difference]: With dead ends: 233 [2024-10-31 22:15:18,206 INFO L226 Difference]: Without dead ends: 154 [2024-10-31 22:15:18,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:15:18,208 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 216 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:18,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 177 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:18,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-31 22:15:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2024-10-31 22:15:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 84 states have internal predecessors, (117), 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) [2024-10-31 22:15:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-10-31 22:15:18,228 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 116 [2024-10-31 22:15:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:18,229 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-10-31 22:15:18,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-10-31 22:15:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-31 22:15:18,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:18,231 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:18,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:15:18,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:18,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash -424432187, now seen corresponding path program 1 times [2024-10-31 22:15:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909654320] [2024-10-31 22:15:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:18,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909654320] [2024-10-31 22:15:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909654320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:18,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:18,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:18,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030770185] [2024-10-31 22:15:18,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:18,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:18,877 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:19,154 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2024-10-31 22:15:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:19,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-10-31 22:15:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:19,158 INFO L225 Difference]: With dead ends: 295 [2024-10-31 22:15:19,159 INFO L226 Difference]: Without dead ends: 196 [2024-10-31 22:15:19,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:19,161 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 186 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:19,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 332 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-31 22:15:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 113. [2024-10-31 22:15:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 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) [2024-10-31 22:15:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-31 22:15:19,189 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 116 [2024-10-31 22:15:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:19,189 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-31 22:15:19,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-31 22:15:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-31 22:15:19,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:19,192 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:19,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:15:19,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:19,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1000934481, now seen corresponding path program 1 times [2024-10-31 22:15:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400246215] [2024-10-31 22:15:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400246215] [2024-10-31 22:15:19,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400246215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:19,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:19,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:19,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762929322] [2024-10-31 22:15:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:19,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:19,963 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:20,929 INFO L93 Difference]: Finished difference Result 421 states and 608 transitions. [2024-10-31 22:15:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:15:20,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-10-31 22:15:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:20,933 INFO L225 Difference]: With dead ends: 421 [2024-10-31 22:15:20,935 INFO L226 Difference]: Without dead ends: 311 [2024-10-31 22:15:20,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:20,941 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 397 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:20,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 276 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:15:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-31 22:15:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 133. [2024-10-31 22:15:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 115 states have (on average 1.373913043478261) internal successors, (158), 115 states have internal predecessors, (158), 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) [2024-10-31 22:15:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2024-10-31 22:15:21,000 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 117 [2024-10-31 22:15:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2024-10-31 22:15:21,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2024-10-31 22:15:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-31 22:15:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:21,003 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:15:21,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1587740495, now seen corresponding path program 1 times [2024-10-31 22:15:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621399653] [2024-10-31 22:15:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621399653] [2024-10-31 22:15:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621399653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368278127] [2024-10-31 22:15:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:21,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:21,449 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:21,917 INFO L93 Difference]: Finished difference Result 326 states and 466 transitions. [2024-10-31 22:15:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-10-31 22:15:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:21,920 INFO L225 Difference]: With dead ends: 326 [2024-10-31 22:15:21,920 INFO L226 Difference]: Without dead ends: 196 [2024-10-31 22:15:21,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:21,924 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 75 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:21,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 579 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:15:21,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-31 22:15:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 146. [2024-10-31 22:15:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 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) [2024-10-31 22:15:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2024-10-31 22:15:21,981 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 117 [2024-10-31 22:15:21,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:21,982 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2024-10-31 22:15:21,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2024-10-31 22:15:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:15:21,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:21,985 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:21,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:15:21,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:21,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -565600309, now seen corresponding path program 1 times [2024-10-31 22:15:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:21,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414039533] [2024-10-31 22:15:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414039533] [2024-10-31 22:15:22,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414039533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:22,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:22,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:15:22,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087474438] [2024-10-31 22:15:22,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:22,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:15:22,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:15:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:22,551 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:23,161 INFO L93 Difference]: Finished difference Result 388 states and 551 transitions. [2024-10-31 22:15:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:15:23,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-10-31 22:15:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:23,164 INFO L225 Difference]: With dead ends: 388 [2024-10-31 22:15:23,164 INFO L226 Difference]: Without dead ends: 245 [2024-10-31 22:15:23,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:15:23,166 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 175 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:23,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 724 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:15:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-31 22:15:23,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 161. [2024-10-31 22:15:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 143 states have (on average 1.3706293706293706) internal successors, (196), 143 states have internal predecessors, (196), 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) [2024-10-31 22:15:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 228 transitions. [2024-10-31 22:15:23,220 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 228 transitions. Word has length 118 [2024-10-31 22:15:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 228 transitions. [2024-10-31 22:15:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 228 transitions. [2024-10-31 22:15:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-31 22:15:23,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:23,223 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:15:23,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1084541438, now seen corresponding path program 1 times [2024-10-31 22:15:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:23,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158870126] [2024-10-31 22:15:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:23,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158870126] [2024-10-31 22:15:23,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158870126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:23,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:23,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:23,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708268244] [2024-10-31 22:15:23,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:23,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:23,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:23,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:23,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:23,827 INFO L87 Difference]: Start difference. First operand 161 states and 228 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:24,322 INFO L93 Difference]: Finished difference Result 395 states and 545 transitions. [2024-10-31 22:15:24,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-10-31 22:15:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:24,325 INFO L225 Difference]: With dead ends: 395 [2024-10-31 22:15:24,325 INFO L226 Difference]: Without dead ends: 237 [2024-10-31 22:15:24,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:15:24,326 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:24,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 521 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:15:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-31 22:15:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 168. [2024-10-31 22:15:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 150 states have internal predecessors, (193), 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) [2024-10-31 22:15:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 225 transitions. [2024-10-31 22:15:24,369 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 225 transitions. Word has length 118 [2024-10-31 22:15:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:24,370 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 225 transitions. [2024-10-31 22:15:24,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 225 transitions. [2024-10-31 22:15:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:24,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:24,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:24,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:15:24,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:24,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:24,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1953732205, now seen corresponding path program 1 times [2024-10-31 22:15:24,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:24,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188220885] [2024-10-31 22:15:24,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:24,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188220885] [2024-10-31 22:15:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188220885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803674066] [2024-10-31 22:15:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:24,925 INFO L87 Difference]: Start difference. First operand 168 states and 225 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:26,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:26,241 INFO L93 Difference]: Finished difference Result 609 states and 822 transitions. [2024-10-31 22:15:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:15:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:26,244 INFO L225 Difference]: With dead ends: 609 [2024-10-31 22:15:26,244 INFO L226 Difference]: Without dead ends: 444 [2024-10-31 22:15:26,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:15:26,246 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 418 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:26,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 649 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 22:15:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-31 22:15:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 186. [2024-10-31 22:15:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 168 states have (on average 1.2916666666666667) internal successors, (217), 168 states have internal predecessors, (217), 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) [2024-10-31 22:15:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 249 transitions. [2024-10-31 22:15:26,292 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 249 transitions. Word has length 119 [2024-10-31 22:15:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:26,292 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 249 transitions. [2024-10-31 22:15:26,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 249 transitions. [2024-10-31 22:15:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:26,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:26,295 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:15:26,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1273673835, now seen corresponding path program 1 times [2024-10-31 22:15:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572429758] [2024-10-31 22:15:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572429758] [2024-10-31 22:15:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572429758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590629603] [2024-10-31 22:15:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:26,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:26,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:26,857 INFO L87 Difference]: Start difference. First operand 186 states and 249 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:27,315 INFO L93 Difference]: Finished difference Result 445 states and 585 transitions. [2024-10-31 22:15:27,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:27,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:27,318 INFO L225 Difference]: With dead ends: 445 [2024-10-31 22:15:27,318 INFO L226 Difference]: Without dead ends: 262 [2024-10-31 22:15:27,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:15:27,319 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 93 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:27,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 579 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:15:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-31 22:15:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 186. [2024-10-31 22:15:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 168 states have internal predecessors, (216), 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) [2024-10-31 22:15:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 248 transitions. [2024-10-31 22:15:27,360 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 248 transitions. Word has length 119 [2024-10-31 22:15:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:27,361 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 248 transitions. [2024-10-31 22:15:27,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 248 transitions. [2024-10-31 22:15:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:27,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:27,363 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:15:27,364 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:27,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 404865566, now seen corresponding path program 1 times [2024-10-31 22:15:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228929302] [2024-10-31 22:15:27,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:27,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228929302] [2024-10-31 22:15:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228929302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:27,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:27,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480982784] [2024-10-31 22:15:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:27,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:27,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:27,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:27,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:27,948 INFO L87 Difference]: Start difference. First operand 186 states and 248 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:28,413 INFO L93 Difference]: Finished difference Result 428 states and 563 transitions. [2024-10-31 22:15:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:28,416 INFO L225 Difference]: With dead ends: 428 [2024-10-31 22:15:28,417 INFO L226 Difference]: Without dead ends: 245 [2024-10-31 22:15:28,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:15:28,419 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:28,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 638 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:15:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-31 22:15:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 182. [2024-10-31 22:15:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 164 states have (on average 1.2926829268292683) internal successors, (212), 164 states have internal predecessors, (212), 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) [2024-10-31 22:15:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-10-31 22:15:28,465 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 119 [2024-10-31 22:15:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-10-31 22:15:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:28,466 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-10-31 22:15:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:28,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:28,472 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:28,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:15:28,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash 556770954, now seen corresponding path program 1 times [2024-10-31 22:15:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634556882] [2024-10-31 22:15:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:28,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:28,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634556882] [2024-10-31 22:15:28,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634556882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:28,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:28,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912306977] [2024-10-31 22:15:28,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:28,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:28,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:28,629 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:28,750 INFO L93 Difference]: Finished difference Result 416 states and 559 transitions. [2024-10-31 22:15:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:28,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:28,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:28,753 INFO L225 Difference]: With dead ends: 416 [2024-10-31 22:15:28,753 INFO L226 Difference]: Without dead ends: 237 [2024-10-31 22:15:28,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:28,755 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 84 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:28,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 184 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:15:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-31 22:15:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 189. [2024-10-31 22:15:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.286549707602339) internal successors, (220), 171 states have internal predecessors, (220), 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) [2024-10-31 22:15:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2024-10-31 22:15:28,801 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 119 [2024-10-31 22:15:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2024-10-31 22:15:28,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2024-10-31 22:15:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:28,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:28,806 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:28,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:15:28,807 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1991680652, now seen corresponding path program 1 times [2024-10-31 22:15:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126857214] [2024-10-31 22:15:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:28,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126857214] [2024-10-31 22:15:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126857214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:28,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:28,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924144127] [2024-10-31 22:15:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:28,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:29,002 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:29,145 INFO L93 Difference]: Finished difference Result 422 states and 564 transitions. [2024-10-31 22:15:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:29,148 INFO L225 Difference]: With dead ends: 422 [2024-10-31 22:15:29,148 INFO L226 Difference]: Without dead ends: 236 [2024-10-31 22:15:29,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:29,149 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:29,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:15:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-31 22:15:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 189. [2024-10-31 22:15:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 171 states have (on average 1.2690058479532165) internal successors, (217), 171 states have internal predecessors, (217), 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) [2024-10-31 22:15:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 249 transitions. [2024-10-31 22:15:29,190 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 249 transitions. Word has length 119 [2024-10-31 22:15:29,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:29,191 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 249 transitions. [2024-10-31 22:15:29,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 249 transitions. [2024-10-31 22:15:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-31 22:15:29,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:29,193 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:29,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:15:29,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1407002939, now seen corresponding path program 1 times [2024-10-31 22:15:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:29,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530171099] [2024-10-31 22:15:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:29,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:29,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530171099] [2024-10-31 22:15:29,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530171099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:15:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479963797] [2024-10-31 22:15:29,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:29,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:15:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:15:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:29,344 INFO L87 Difference]: Start difference. First operand 189 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:29,494 INFO L93 Difference]: Finished difference Result 420 states and 556 transitions. [2024-10-31 22:15:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:15:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-10-31 22:15:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:29,497 INFO L225 Difference]: With dead ends: 420 [2024-10-31 22:15:29,497 INFO L226 Difference]: Without dead ends: 234 [2024-10-31 22:15:29,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:15:29,499 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 68 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:29,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 247 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:15:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-31 22:15:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 170. [2024-10-31 22:15:29,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 152 states have (on average 1.263157894736842) internal successors, (192), 152 states have internal predecessors, (192), 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) [2024-10-31 22:15:29,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2024-10-31 22:15:29,552 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 119 [2024-10-31 22:15:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:29,552 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2024-10-31 22:15:29,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2024-10-31 22:15:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:29,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:29,555 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:29,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:15:29,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:29,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:29,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1078078777, now seen corresponding path program 1 times [2024-10-31 22:15:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:29,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580935194] [2024-10-31 22:15:29,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:29,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580935194] [2024-10-31 22:15:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580935194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:15:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15620856] [2024-10-31 22:15:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:29,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:15:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:15:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:15:29,824 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:30,622 INFO L93 Difference]: Finished difference Result 488 states and 646 transitions. [2024-10-31 22:15:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:15:30,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-10-31 22:15:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:30,625 INFO L225 Difference]: With dead ends: 488 [2024-10-31 22:15:30,626 INFO L226 Difference]: Without dead ends: 321 [2024-10-31 22:15:30,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:30,628 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 298 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:30,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 272 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:15:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-31 22:15:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 178. [2024-10-31 22:15:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 160 states have (on average 1.24375) internal successors, (199), 160 states have internal predecessors, (199), 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) [2024-10-31 22:15:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 231 transitions. [2024-10-31 22:15:30,680 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 231 transitions. Word has length 120 [2024-10-31 22:15:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:30,681 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 231 transitions. [2024-10-31 22:15:30,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 231 transitions. [2024-10-31 22:15:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:30,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:30,683 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:30,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:15:30,684 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:30,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1471105787, now seen corresponding path program 1 times [2024-10-31 22:15:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:30,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129169074] [2024-10-31 22:15:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:30,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:31,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129169074] [2024-10-31 22:15:31,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129169074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:31,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:31,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046905151] [2024-10-31 22:15:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:31,632 INFO L87 Difference]: Start difference. First operand 178 states and 231 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:32,092 INFO L93 Difference]: Finished difference Result 492 states and 635 transitions. [2024-10-31 22:15:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-10-31 22:15:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:32,094 INFO L225 Difference]: With dead ends: 492 [2024-10-31 22:15:32,094 INFO L226 Difference]: Without dead ends: 317 [2024-10-31 22:15:32,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:32,096 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 57 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:32,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 342 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-31 22:15:32,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2024-10-31 22:15:32,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2525597269624573) internal successors, (367), 294 states have internal predecessors, (367), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:15:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 403 transitions. [2024-10-31 22:15:32,152 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 403 transitions. Word has length 120 [2024-10-31 22:15:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:32,152 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 403 transitions. [2024-10-31 22:15:32,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 403 transitions. [2024-10-31 22:15:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:32,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:32,154 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:15:32,155 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1222743813, now seen corresponding path program 1 times [2024-10-31 22:15:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300673418] [2024-10-31 22:15:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:32,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:32,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300673418] [2024-10-31 22:15:32,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300673418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:32,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:32,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:32,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836728700] [2024-10-31 22:15:32,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:32,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:32,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:32,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:32,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:32,542 INFO L87 Difference]: Start difference. First operand 314 states and 403 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:32,861 INFO L93 Difference]: Finished difference Result 713 states and 903 transitions. [2024-10-31 22:15:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-10-31 22:15:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:32,865 INFO L225 Difference]: With dead ends: 713 [2024-10-31 22:15:32,865 INFO L226 Difference]: Without dead ends: 402 [2024-10-31 22:15:32,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:15:32,867 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 68 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:32,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 471 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-10-31 22:15:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 277. [2024-10-31 22:15:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 256 states have (on average 1.265625) internal successors, (324), 257 states have internal predecessors, (324), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:15:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 360 transitions. [2024-10-31 22:15:32,922 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 360 transitions. Word has length 120 [2024-10-31 22:15:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:32,923 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 360 transitions. [2024-10-31 22:15:32,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 360 transitions. [2024-10-31 22:15:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:32,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:32,925 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:32,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:15:32,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash -623649724, now seen corresponding path program 1 times [2024-10-31 22:15:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297802832] [2024-10-31 22:15:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:33,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:33,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297802832] [2024-10-31 22:15:33,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297802832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:33,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:33,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:15:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161446636] [2024-10-31 22:15:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:33,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:15:33,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:15:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:15:33,997 INFO L87 Difference]: Start difference. First operand 277 states and 360 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:34,818 INFO L93 Difference]: Finished difference Result 554 states and 719 transitions. [2024-10-31 22:15:34,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:15:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-10-31 22:15:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:34,822 INFO L225 Difference]: With dead ends: 554 [2024-10-31 22:15:34,822 INFO L226 Difference]: Without dead ends: 280 [2024-10-31 22:15:34,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:15:34,824 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 99 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:34,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 452 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:15:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-31 22:15:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2024-10-31 22:15:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 256 states have (on average 1.24609375) internal successors, (319), 257 states have internal predecessors, (319), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-31 22:15:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2024-10-31 22:15:34,887 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 120 [2024-10-31 22:15:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:34,887 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2024-10-31 22:15:34,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2024-10-31 22:15:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:34,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:34,890 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:34,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:15:34,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:34,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:34,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1794022991, now seen corresponding path program 1 times [2024-10-31 22:15:34,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414326392] [2024-10-31 22:15:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:34,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:15:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:15:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:15:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:15:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:15:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:15:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:15:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-31 22:15:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:15:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-31 22:15:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-31 22:15:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-31 22:15:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-31 22:15:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-31 22:15:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-31 22:15:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-31 22:15:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:15:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-31 22:15:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:15:35,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414326392] [2024-10-31 22:15:35,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414326392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:15:35,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:15:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:15:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175131672] [2024-10-31 22:15:35,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:15:35,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:15:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:15:35,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:15:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:15:35,466 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:35,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:15:35,776 INFO L93 Difference]: Finished difference Result 707 states and 913 transitions. [2024-10-31 22:15:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:15:35,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-10-31 22:15:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:15:35,779 INFO L225 Difference]: With dead ends: 707 [2024-10-31 22:15:35,779 INFO L226 Difference]: Without dead ends: 433 [2024-10-31 22:15:35,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:15:35,782 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 90 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:15:35,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 329 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:15:35,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-31 22:15:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 311. [2024-10-31 22:15:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 273 states have (on average 1.2307692307692308) internal successors, (336), 274 states have internal predecessors, (336), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-31 22:15:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 404 transitions. [2024-10-31 22:15:35,898 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 404 transitions. Word has length 120 [2024-10-31 22:15:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:15:35,899 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 404 transitions. [2024-10-31 22:15:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-31 22:15:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 404 transitions. [2024-10-31 22:15:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-31 22:15:35,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:15:35,904 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:35,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:15:35,905 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:15:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:15:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1236481476, now seen corresponding path program 1 times [2024-10-31 22:15:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:15:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846579437] [2024-10-31 22:15:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:15:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:15:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:35,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:15:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:15:36,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:15:36,102 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:15:36,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:15:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:15:36,110 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:15:36,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:15:36,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:15:36 BoogieIcfgContainer [2024-10-31 22:15:36,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:15:36,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:15:36,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:15:36,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:15:36,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:15:16" (3/4) ... [2024-10-31 22:15:36,263 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:15:36,264 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:15:36,265 INFO L158 Benchmark]: Toolchain (without parser) took 21620.67ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 89.6MB in the beginning and 271.3MB in the end (delta: -181.7MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,265 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 125.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:15:36,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.01ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 73.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.36ms. Allocated memory is still 125.8MB. Free memory was 73.2MB in the beginning and 69.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,267 INFO L158 Benchmark]: Boogie Preprocessor took 84.03ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 64.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,267 INFO L158 Benchmark]: RCFGBuilder took 740.63ms. Allocated memory is still 125.8MB. Free memory was 64.2MB in the beginning and 89.2MB in the end (delta: -25.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,271 INFO L158 Benchmark]: TraceAbstraction took 20251.47ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 88.5MB in the beginning and 272.3MB in the end (delta: -183.8MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. [2024-10-31 22:15:36,272 INFO L158 Benchmark]: Witness Printer took 5.83ms. Allocated memory is still 308.3MB. Free memory is still 271.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:15:36,273 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 125.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.01ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 73.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.36ms. Allocated memory is still 125.8MB. Free memory was 73.2MB in the beginning and 69.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.03ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 64.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 740.63ms. Allocated memory is still 125.8MB. Free memory was 64.2MB in the beginning and 89.2MB in the end (delta: -25.1MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20251.47ms. Allocated memory was 125.8MB in the beginning and 308.3MB in the end (delta: 182.5MB). Free memory was 88.5MB in the beginning and 272.3MB in the end (delta: -183.8MB). Peak memory consumption was 177.6MB. Max. memory is 16.1GB. * Witness Printer took 5.83ms. Allocated memory is still 308.3MB. Free memory is still 271.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=10, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=0, var_1_17=505, var_1_1=-252, var_1_22=505, var_1_24=-64, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2580 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2580 mSDsluCounter, 7250 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4780 mSDsCounter, 517 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2854 IncrementalHoareTripleChecker+Invalid, 3371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 517 mSolverCounterUnsat, 2470 mSDtfsCounter, 2854 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 778 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=16, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 1486 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2368 NumberOfCodeBlocks, 2368 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2229 ConstructedInterpolants, 0 QuantifiedInterpolants, 5482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:15:36,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:15:39,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:15:39,132 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:15:39,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:15:39,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:15:39,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:15:39,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:15:39,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:15:39,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:15:39,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:15:39,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:15:39,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:15:39,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:15:39,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:15:39,169 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:15:39,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:15:39,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:15:39,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:15:39,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:15:39,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:15:39,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:15:39,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:15:39,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:15:39,172 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:15:39,173 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:15:39,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:15:39,173 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:15:39,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:15:39,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:15:39,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:15:39,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:15:39,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:15:39,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:15:39,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:15:39,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:15:39,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:15:39,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:15:39,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:15:39,178 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:15:39,178 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:15:39,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:15:39,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:15:39,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:15:39,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:15:39,180 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:15:39,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/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_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-10-31 22:15:39,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:15:39,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:15:39,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:15:39,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:15:39,710 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:15:39,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca747881-41f9-404c-9907-e23cad3eb4cd/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i