./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:48,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:48,799 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:48:48,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:48,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:48,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:48,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:48,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:48,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:48,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:48,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:48,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:48,848 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:48,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:48,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:48:48,851 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:48,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:48,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:48,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:48,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:48:48,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:48,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:48:48,854 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:48,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:48:48,856 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:48,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:48,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:48,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:48,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:48,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:48,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:48,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:48:48,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:48:48,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:48:48,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:48,861 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:48:48,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:48,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:48,862 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:48,862 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_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/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_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2023-11-06 22:48:49,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:49,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:49,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:49,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:49,268 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:49,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:48:52,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:48:52,572 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:48:52,572 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:48:52,584 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/dd663abe0/674345c229c9489c80e8d9b4d9fd6e59/FLAGe567071c1 [2023-11-06 22:48:52,600 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/dd663abe0/674345c229c9489c80e8d9b4d9fd6e59 [2023-11-06 22:48:52,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:48:52,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:48:52,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:52,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:48:52,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:48:52,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:52,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c9a4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52, skipping insertion in model container [2023-11-06 22:48:52,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:52,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:48:52,821 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-06 22:48:52,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:52,895 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:48:52,908 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-06 22:48:52,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:48:52,967 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:48:52,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52 WrapperNode [2023-11-06 22:48:52,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:48:52,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:52,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:48:52,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:48:52,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:52,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,065 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 486 [2023-11-06 22:48:53,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:48:53,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:48:53,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:48:53,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:48:53,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:48:53,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:48:53,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:48:53,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:48:53,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (1/1) ... [2023-11-06 22:48:53,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:53,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:48:53,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:48:53,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:48:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:48:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:48:53,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:48:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:48:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:48:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:48:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:48:53,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:48:53,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:48:53,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:48:53,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:48:53,333 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:48:53,335 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:48:53,983 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:48:53,991 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:48:53,991 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:48:53,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:53 BoogieIcfgContainer [2023-11-06 22:48:53,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:48:53,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:48:53,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:48:54,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:48:54,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:48:52" (1/3) ... [2023-11-06 22:48:54,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4274821d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:54, skipping insertion in model container [2023-11-06 22:48:54,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:48:52" (2/3) ... [2023-11-06 22:48:54,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4274821d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:48:54, skipping insertion in model container [2023-11-06 22:48:54,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:53" (3/3) ... [2023-11-06 22:48:54,009 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:48:54,030 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:48:54,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:48:54,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:54,098 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dfb9fa4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:54,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:48:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 108 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:48:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:48:54,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:54,119 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:54,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:54,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1946377046, now seen corresponding path program 1 times [2023-11-06 22:48:54,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:54,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908263941] [2023-11-06 22:48:54,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:48:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:48:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:48:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:48:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:48:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:48:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:48:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:48:56,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:56,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908263941] [2023-11-06 22:48:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908263941] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642390758] [2023-11-06 22:48:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:56,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:56,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:56,388 INFO L87 Difference]: Start difference. First operand has 121 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 108 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:48:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:56,841 INFO L93 Difference]: Finished difference Result 350 states and 558 transitions. [2023-11-06 22:48:56,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2023-11-06 22:48:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:56,861 INFO L225 Difference]: With dead ends: 350 [2023-11-06 22:48:56,862 INFO L226 Difference]: Without dead ends: 232 [2023-11-06 22:48:56,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:56,871 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 118 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:56,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 267 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:48:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-06 22:48:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2023-11-06 22:48:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.477832512315271) internal successors, (300), 203 states have internal predecessors, (300), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:48:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2023-11-06 22:48:56,969 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 109 [2023-11-06 22:48:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:56,972 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2023-11-06 22:48:56,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:48:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2023-11-06 22:48:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:48:56,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:56,982 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:56,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:48:56,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:56,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 666513368, now seen corresponding path program 1 times [2023-11-06 22:48:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:56,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868563467] [2023-11-06 22:48:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:48:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:48:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:48:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:48:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:48:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:48:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:48:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:48:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868563467] [2023-11-06 22:48:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868563467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242410945] [2023-11-06 22:48:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:58,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:58,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:58,688 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:48:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:48:59,099 INFO L93 Difference]: Finished difference Result 506 states and 765 transitions. [2023-11-06 22:48:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2023-11-06 22:48:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:48:59,103 INFO L225 Difference]: With dead ends: 506 [2023-11-06 22:48:59,103 INFO L226 Difference]: Without dead ends: 281 [2023-11-06 22:48:59,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:59,114 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 207 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:48:59,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 305 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 22:48:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-06 22:48:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 229. [2023-11-06 22:48:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 204 states have (on average 1.4754901960784315) internal successors, (301), 204 states have internal predecessors, (301), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:48:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2023-11-06 22:48:59,138 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 109 [2023-11-06 22:48:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:48:59,139 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2023-11-06 22:48:59,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:48:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2023-11-06 22:48:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-06 22:48:59,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:48:59,141 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:59,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:48:59,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:48:59,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:59,142 INFO L85 PathProgramCache]: Analyzing trace with hash 924678806, now seen corresponding path program 1 times [2023-11-06 22:48:59,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:48:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668642896] [2023-11-06 22:48:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:48:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:48:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:48:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:48:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:48:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:48:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:48:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:48:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:48:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:48:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:48:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:48:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:48:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:48:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668642896] [2023-11-06 22:48:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668642896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:59,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:48:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429093691] [2023-11-06 22:48:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:48:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:59,980 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:00,811 INFO L93 Difference]: Finished difference Result 955 states and 1445 transitions. [2023-11-06 22:49:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:49:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2023-11-06 22:49:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:00,818 INFO L225 Difference]: With dead ends: 955 [2023-11-06 22:49:00,818 INFO L226 Difference]: Without dead ends: 729 [2023-11-06 22:49:00,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:00,823 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 389 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:00,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 904 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 22:49:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2023-11-06 22:49:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 268. [2023-11-06 22:49:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:49:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2023-11-06 22:49:00,855 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 109 [2023-11-06 22:49:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:00,856 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2023-11-06 22:49:00,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2023-11-06 22:49:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-06 22:49:00,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:00,858 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:00,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:49:00,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:00,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 227256814, now seen corresponding path program 1 times [2023-11-06 22:49:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404701533] [2023-11-06 22:49:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:49:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:49:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:49:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:49:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:49:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:49:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:49:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:49:01,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404701533] [2023-11-06 22:49:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404701533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:49:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618280919] [2023-11-06 22:49:01,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:01,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:49:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:49:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:49:01,786 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:49:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:02,454 INFO L93 Difference]: Finished difference Result 778 states and 1178 transitions. [2023-11-06 22:49:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:49:02,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2023-11-06 22:49:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:02,459 INFO L225 Difference]: With dead ends: 778 [2023-11-06 22:49:02,459 INFO L226 Difference]: Without dead ends: 513 [2023-11-06 22:49:02,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:49:02,461 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 222 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:02,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 499 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:49:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-11-06 22:49:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 239. [2023-11-06 22:49:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 214 states have (on average 1.47196261682243) internal successors, (315), 214 states have internal predecessors, (315), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:49:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 359 transitions. [2023-11-06 22:49:02,490 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 359 transitions. Word has length 111 [2023-11-06 22:49:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:02,490 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 359 transitions. [2023-11-06 22:49:02,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-06 22:49:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 359 transitions. [2023-11-06 22:49:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:49:02,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:02,492 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:49:02,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:02,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1987092815, now seen corresponding path program 1 times [2023-11-06 22:49:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:02,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541253123] [2023-11-06 22:49:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:49:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:49:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:49:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:49:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:49:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:49:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:49:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:49:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541253123] [2023-11-06 22:49:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541253123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722969729] [2023-11-06 22:49:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:02,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:02,588 INFO L87 Difference]: Start difference. First operand 239 states and 359 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:02,630 INFO L93 Difference]: Finished difference Result 603 states and 911 transitions. [2023-11-06 22:49:02,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:49:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:02,634 INFO L225 Difference]: With dead ends: 603 [2023-11-06 22:49:02,634 INFO L226 Difference]: Without dead ends: 367 [2023-11-06 22:49:02,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:02,636 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 79 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:02,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 333 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-06 22:49:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 315. [2023-11-06 22:49:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 290 states have (on average 1.4965517241379311) internal successors, (434), 290 states have internal predecessors, (434), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:49:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 478 transitions. [2023-11-06 22:49:02,661 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 478 transitions. Word has length 112 [2023-11-06 22:49:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:02,662 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 478 transitions. [2023-11-06 22:49:02,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 478 transitions. [2023-11-06 22:49:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-06 22:49:02,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:02,664 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:02,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:49:02,664 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:02,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1286028237, now seen corresponding path program 1 times [2023-11-06 22:49:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404866456] [2023-11-06 22:49:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-06 22:49:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:49:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-06 22:49:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:49:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:49:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:49:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-06 22:49:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:49:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:49:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:49:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:49:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-11-06 22:49:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404866456] [2023-11-06 22:49:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404866456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:49:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884340073] [2023-11-06 22:49:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:02,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:49:02,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:02,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:49:02,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:49:02,852 INFO L87 Difference]: Start difference. First operand 315 states and 478 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:49:02,911 INFO L93 Difference]: Finished difference Result 663 states and 1007 transitions. [2023-11-06 22:49:02,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:49:02,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2023-11-06 22:49:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:49:02,914 INFO L225 Difference]: With dead ends: 663 [2023-11-06 22:49:02,915 INFO L226 Difference]: Without dead ends: 351 [2023-11-06 22:49:02,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:49:02,916 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 77 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:49:02,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 679 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:49:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-06 22:49:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 321. [2023-11-06 22:49:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 296 states have (on average 1.4864864864864864) internal successors, (440), 296 states have internal predecessors, (440), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:49:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 484 transitions. [2023-11-06 22:49:02,941 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 484 transitions. Word has length 112 [2023-11-06 22:49:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:49:02,942 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 484 transitions. [2023-11-06 22:49:02,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-06 22:49:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 484 transitions. [2023-11-06 22:49:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-06 22:49:02,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:02,944 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:02,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:49:02,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:02,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -293386302, now seen corresponding path program 1 times [2023-11-06 22:49:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268729844] [2023-11-06 22:49:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:03,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:49:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:49:03,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:49:03,101 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:49:03,103 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:49:03,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:49:03,108 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:03,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:49:03,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:49:03 BoogieIcfgContainer [2023-11-06 22:49:03,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:49:03,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:49:03,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:49:03,179 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:49:03,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:48:53" (3/4) ... [2023-11-06 22:49:03,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:49:03,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:49:03,183 INFO L158 Benchmark]: Toolchain (without parser) took 10578.22ms. Allocated memory was 151.0MB in the beginning and 323.0MB in the end (delta: 172.0MB). Free memory was 106.0MB in the beginning and 268.4MB in the end (delta: -162.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,183 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 151.0MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:03,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.25ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.97ms. Allocated memory is still 151.0MB. Free memory was 89.8MB in the beginning and 85.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,185 INFO L158 Benchmark]: Boogie Preprocessor took 64.74ms. Allocated memory is still 151.0MB. Free memory was 85.8MB in the beginning and 82.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,185 INFO L158 Benchmark]: RCFGBuilder took 861.63ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 82.3MB in the beginning and 184.2MB in the end (delta: -101.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,186 INFO L158 Benchmark]: TraceAbstraction took 9179.29ms. Allocated memory was 218.1MB in the beginning and 323.0MB in the end (delta: 104.9MB). Free memory was 183.1MB in the beginning and 268.4MB in the end (delta: -85.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2023-11-06 22:49:03,186 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 323.0MB. Free memory is still 268.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:03,188 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.28ms. Allocated memory is still 151.0MB. Free memory was 119.5MB in the beginning and 119.4MB in the end (delta: 73.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.25ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.97ms. Allocated memory is still 151.0MB. Free memory was 89.8MB in the beginning and 85.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.74ms. Allocated memory is still 151.0MB. Free memory was 85.8MB in the beginning and 82.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 861.63ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 82.3MB in the beginning and 184.2MB in the end (delta: -101.8MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9179.29ms. Allocated memory was 218.1MB in the beginning and 323.0MB in the end (delta: 104.9MB). Free memory was 183.1MB in the beginning and 268.4MB in the end (delta: -85.3MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 323.0MB. Free memory is still 268.4MB. 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 someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of shiftRight at line 55. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned char last_1_WrapperStruct00_var_1_14 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_14=1] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_14 [L109] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L88] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00.var_1_3=10000000002, WrapperStruct00.var_1_3=10000000002, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=10000000002, WrapperStruct00.var_1_3=10000000002, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )=1, WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F=1, WrapperStruct00.var_1_3=10000000002, WrapperStruct00.var_1_3=10000000002, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00.var_1_4=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00.var_1_4=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00.var_1_4=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00.var_1_5=10000000008, WrapperStruct00.var_1_5=10000000008, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )=1, WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F=1, WrapperStruct00.var_1_5=10000000008, WrapperStruct00.var_1_5=10000000008, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )=1, WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F=1, WrapperStruct00.var_1_5=10000000008, WrapperStruct00.var_1_5=10000000008, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00.var_1_9=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00.var_1_9=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00.var_1_9=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00.var_1_11=10000000000, WrapperStruct00.var_1_11=10000000000, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=10000000000, WrapperStruct00.var_1_11=10000000000, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )=1, WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F=1, WrapperStruct00.var_1_11=10000000000, WrapperStruct00.var_1_11=10000000000, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00.var_1_12=10000000007, WrapperStruct00.var_1_12=10000000007, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=10000000007, WrapperStruct00.var_1_12=10000000007, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )=1, WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F=1, WrapperStruct00.var_1_12=10000000007, WrapperStruct00.var_1_12=10000000007, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00.var_1_13=10000000001, WrapperStruct00.var_1_13=10000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [(WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=10000000001, WrapperStruct00.var_1_13=10000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [(WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )=1, WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=10000000001, WrapperStruct00.var_1_13=10000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=254, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00.var_1_16=254, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00.var_1_16=254, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00.var_1_16=254, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14=0, last_1_WrapperStruct00_var_1_14=1] [L55] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L58] EXPR WrapperStruct00.var_1_13 [L58] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00.var_1_12=10000000007, WrapperStruct00.var_1_13=10000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L58] COND FALSE !(WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) [L65] WrapperStruct00.var_1_14 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] EXPR WrapperStruct00.var_1_5 [L67] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00.var_1_3=10000000002, WrapperStruct00.var_1_5=10000000008, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND TRUE WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3 [L68] WrapperStruct00.var_1_10 = 4.6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_10 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10; [L73] stepLocal_0 && WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_7 [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0 && WrapperStruct00.var_1_7=1, stepLocal_0=1] [L73] COND TRUE stepLocal_0 && WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) VAL [((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10))=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L74] EXPR WrapperStruct00.var_1_10 VAL [((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10))=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L74] COND TRUE ((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10 [L75] WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=1, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L75] COND TRUE WrapperStruct00.var_1_7 [L76] WrapperStruct00.var_1_1 = 10u VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7=0, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7=0, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_14=0, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [(((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)=0, ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7=0, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_14=0, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))=0, (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)=0, ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7=0, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_14=0, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [(((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0)))=0, ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))=0, (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)=0, ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))=0, (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7=0, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_10=23/5, WrapperStruct00.var_1_14=0, WrapperStruct00.var_1_1=10, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112-L113] return (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1092 mSDsluCounter, 2987 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2104 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1585 IncrementalHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 883 mSDtfsCounter, 1585 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 873 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 656 ConstructedInterpolants, 0 QuantifiedInterpolants, 1878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:49:03,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:49:05,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:49:05,909 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:49:05,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:49:05,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:49:05,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:49:05,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:49:05,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:49:05,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:49:05,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:49:05,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:49:05,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:49:05,972 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:49:05,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:49:05,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:49:05,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:49:05,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:49:05,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:49:05,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:49:05,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:49:05,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:49:05,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:49:05,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:49:05,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:49:05,982 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:49:05,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:49:05,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:49:05,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:49:05,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:49:05,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:49:05,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:05,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:49:05,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:49:05,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:49:05,987 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:49:05,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:49:05,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:49:05,988 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:49:05,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:49:05,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:49:05,989 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:49:05,989 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:49:05,990 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_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/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_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2023-11-06 22:49:06,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:49:06,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:49:06,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:49:06,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:49:06,410 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:49:06,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:49:09,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:09,791 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:09,793 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:49:09,803 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/d6f603f28/40c18b15c03a4cdea9f56236f9d823c9/FLAG1299dc5bd [2023-11-06 22:49:09,821 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/data/d6f603f28/40c18b15c03a4cdea9f56236f9d823c9 [2023-11-06 22:49:09,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:09,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:09,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:09,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:09,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:09,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:09" (1/1) ... [2023-11-06 22:49:09,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471bfbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:09, skipping insertion in model container [2023-11-06 22:49:09,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:09" (1/1) ... [2023-11-06 22:49:09,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:10,026 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-06 22:49:10,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:10,096 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:10,118 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2023-11-06 22:49:10,195 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:10,231 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:10,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10 WrapperNode [2023-11-06 22:49:10,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:10,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:10,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:10,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:10,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,307 INFO L138 Inliner]: procedures = 36, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2023-11-06 22:49:10,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:10,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:10,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:10,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:10,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:10,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:10,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:10,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:10,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (1/1) ... [2023-11-06 22:49:10,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:10,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:10,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:10,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:49:10,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:49:10,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:49:10,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:49:10,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:49:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:49:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:49:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 22:49:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:49:10,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:49:10,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 22:49:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 22:49:10,484 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:49:10,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:49:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:10,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:49:10,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:49:10,616 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:10,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:11,720 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:11,728 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:11,728 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:49:11,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:11 BoogieIcfgContainer [2023-11-06 22:49:11,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:11,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:49:11,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:49:11,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:49:11,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:09" (1/3) ... [2023-11-06 22:49:11,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512c8e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:11, skipping insertion in model container [2023-11-06 22:49:11,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:10" (2/3) ... [2023-11-06 22:49:11,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512c8e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:11, skipping insertion in model container [2023-11-06 22:49:11,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:11" (3/3) ... [2023-11-06 22:49:11,744 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-11-06 22:49:11,783 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:49:11,783 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:49:11,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:11,857 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1152019f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:11,858 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:49:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 105 states have (on average 1.4857142857142858) internal successors, (156), 106 states have internal predecessors, (156), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-06 22:49:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-06 22:49:11,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:49:11,879 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:11,879 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:49:11,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash 91120692, now seen corresponding path program 1 times [2023-11-06 22:49:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:49:11,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717504005] [2023-11-06 22:49:11,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:11,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:49:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:49:11,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:49:11,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:49:12,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:49:12,197 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 22:49:12,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 22:49:12,204 INFO L158 Benchmark]: Toolchain (without parser) took 2375.08ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 49.5MB in the beginning and 54.3MB in the end (delta: -4.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-11-06 22:49:12,204 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:12,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.02ms. Allocated memory is still 77.6MB. Free memory was 49.3MB in the beginning and 53.4MB in the end (delta: -4.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-11-06 22:49:12,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.88ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 49.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:12,206 INFO L158 Benchmark]: Boogie Preprocessor took 84.47ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 45.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:49:12,207 INFO L158 Benchmark]: RCFGBuilder took 1337.98ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 45.6MB in the beginning and 49.9MB in the end (delta: -4.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-11-06 22:49:12,208 INFO L158 Benchmark]: TraceAbstraction took 465.52ms. Allocated memory is still 100.7MB. Free memory was 49.5MB in the beginning and 54.3MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:49:12,211 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.28ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.02ms. Allocated memory is still 77.6MB. Free memory was 49.3MB in the beginning and 53.4MB in the end (delta: -4.1MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.88ms. Allocated memory is still 77.6MB. Free memory was 53.4MB in the beginning and 49.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.47ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 45.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1337.98ms. Allocated memory was 77.6MB in the beginning and 100.7MB in the end (delta: 23.1MB). Free memory was 45.6MB in the beginning and 49.9MB in the end (delta: -4.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 465.52ms. Allocated memory is still 100.7MB. Free memory was 49.5MB in the beginning and 54.3MB in the end (delta: -4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 22:49:12,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_646ab771-0e04-4408-a10c-a9e041ba6600/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.