./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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 08148e8c3c8eecfc4014e5c0b3637b2b2d997939cef63f1309d0f584d4ec63a9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:34:58,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:34:58,803 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:34:58,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:34:58,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:34:58,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:34:58,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:34:58,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:34:58,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:34:58,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:34:58,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:34:58,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:34:58,889 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:34:58,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:34:58,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:34:58,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:34:58,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:34:58,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:34:58,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:34:58,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:34:58,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:34:58,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:34:58,895 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:34:58,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:34:58,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:34:58,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:34:58,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:34:58,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:34:58,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:58,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:34:58,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:34:58,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:34:58,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:34:58,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:34:58,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:34:58,902 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:34:58,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:34:58,909 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:34:58,909 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:34:58,909 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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 -> 08148e8c3c8eecfc4014e5c0b3637b2b2d997939cef63f1309d0f584d4ec63a9 [2023-11-06 22:34:59,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:34:59,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:34:59,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:34:59,284 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:34:59,284 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:34:59,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:02,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:02,612 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:02,613 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:02,622 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/69892e362/3b870b6dd97847f894b74a869dbd3e02/FLAGf50bf7839 [2023-11-06 22:35:02,642 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/69892e362/3b870b6dd97847f894b74a869dbd3e02 [2023-11-06 22:35:02,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:02,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:02,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:02,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:02,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:02,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:02,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d596e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02, skipping insertion in model container [2023-11-06 22:35:02,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:02,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:02,843 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i[916,929] [2023-11-06 22:35:02,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:02,907 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:02,920 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i[916,929] [2023-11-06 22:35:02,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:02,986 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:02,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02 WrapperNode [2023-11-06 22:35:02,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:02,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:02,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:02,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:03,003 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:35:02" (1/1) ... [2023-11-06 22:35:03,017 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:35:02" (1/1) ... [2023-11-06 22:35:03,064 INFO L138 Inliner]: procedures = 29, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 347 [2023-11-06 22:35:03,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:03,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:03,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:03,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:03,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:03,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:03,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:03,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:03,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (1/1) ... [2023-11-06 22:35:03,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:03,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 22:35:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:35:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 22:35:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:35:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 22:35:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:35:03,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:03,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:03,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:03,411 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:03,429 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:04,110 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:04,117 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:04,117 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:35:04,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:04 BoogieIcfgContainer [2023-11-06 22:35:04,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:04,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:04,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:04,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:04,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:02" (1/3) ... [2023-11-06 22:35:04,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ececba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:04, skipping insertion in model container [2023-11-06 22:35:04,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:02" (2/3) ... [2023-11-06 22:35:04,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ececba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:04, skipping insertion in model container [2023-11-06 22:35:04,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:04" (3/3) ... [2023-11-06 22:35:04,129 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:04,149 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:04,149 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:04,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:04,210 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;@fecbb1c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:04,210 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:35:04,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:35:04,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:04,230 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:04,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:04,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 87027742, now seen corresponding path program 1 times [2023-11-06 22:35:04,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:04,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951886580] [2023-11-06 22:35:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:35:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:35:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:35:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:35:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951886580] [2023-11-06 22:35:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951886580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:04,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:04,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:35:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112477316] [2023-11-06 22:35:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:04,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:35:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:04,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:35:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:04,734 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:35:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:04,770 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2023-11-06 22:35:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:35:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2023-11-06 22:35:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:04,783 INFO L225 Difference]: With dead ends: 167 [2023-11-06 22:35:04,783 INFO L226 Difference]: Without dead ends: 81 [2023-11-06 22:35:04,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:35:04,791 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:04,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-06 22:35:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-06 22:35:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:35:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2023-11-06 22:35:04,845 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2023-11-06 22:35:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:04,846 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2023-11-06 22:35:04,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:35:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2023-11-06 22:35:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:35:04,851 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:04,851 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:04,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:35:04,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:04,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1324648994, now seen corresponding path program 1 times [2023-11-06 22:35:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219519879] [2023-11-06 22:35:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:35:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:35:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:35:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:35:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:05,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219519879] [2023-11-06 22:35:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219519879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:05,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:05,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:35:05,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010786796] [2023-11-06 22:35:05,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:05,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:35:05,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:05,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:35:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:35:05,419 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:05,534 INFO L93 Difference]: Finished difference Result 181 states and 260 transitions. [2023-11-06 22:35:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:35:05,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-11-06 22:35:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:05,539 INFO L225 Difference]: With dead ends: 181 [2023-11-06 22:35:05,542 INFO L226 Difference]: Without dead ends: 103 [2023-11-06 22:35:05,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:35:05,546 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 45 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 340 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-06 22:35:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2023-11-06 22:35:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:35:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2023-11-06 22:35:05,573 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2023-11-06 22:35:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:05,576 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2023-11-06 22:35:05,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2023-11-06 22:35:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:35:05,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:05,586 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:05,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:35:05,586 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:05,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2004707364, now seen corresponding path program 1 times [2023-11-06 22:35:05,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:05,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780089538] [2023-11-06 22:35:05,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:35:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:35:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:35:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:35:06,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780089538] [2023-11-06 22:35:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780089538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:35:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102608647] [2023-11-06 22:35:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:06,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:35:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:35:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:35:06,268 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:06,499 INFO L93 Difference]: Finished difference Result 199 states and 278 transitions. [2023-11-06 22:35:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:35:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2023-11-06 22:35:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:06,502 INFO L225 Difference]: With dead ends: 199 [2023-11-06 22:35:06,503 INFO L226 Difference]: Without dead ends: 119 [2023-11-06 22:35:06,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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:35:06,505 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 85 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:06,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 429 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:35:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-06 22:35:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2023-11-06 22:35:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 98 states have internal predecessors, (129), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:35:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2023-11-06 22:35:06,524 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 114 [2023-11-06 22:35:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:06,525 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2023-11-06 22:35:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2023-11-06 22:35:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-06 22:35:06,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:06,528 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:06,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:35:06,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:06,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 299123064, now seen corresponding path program 1 times [2023-11-06 22:35:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170468109] [2023-11-06 22:35:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:35:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:35:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:35:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:35:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:35:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:35:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:35:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:35:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:35:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-06 22:35:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-06 22:35:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 22:35:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 22:35:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 22:35:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:35:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:35:06,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:35:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170468109] [2023-11-06 22:35:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170468109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:35:06,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:35:06,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:35:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28499671] [2023-11-06 22:35:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:35:06,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:35:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:35:06,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:35:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:35:06,829 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:35:06,842 INFO L93 Difference]: Finished difference Result 200 states and 277 transitions. [2023-11-06 22:35:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:35:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2023-11-06 22:35:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:35:06,846 INFO L225 Difference]: With dead ends: 200 [2023-11-06 22:35:06,846 INFO L226 Difference]: Without dead ends: 87 [2023-11-06 22:35:06,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:35:06,849 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:35:06,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:35:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-06 22:35:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-11-06 22:35:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 69 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:35:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 118 transitions. [2023-11-06 22:35:06,862 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 118 transitions. Word has length 115 [2023-11-06 22:35:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:35:06,863 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 118 transitions. [2023-11-06 22:35:06,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-06 22:35:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 118 transitions. [2023-11-06 22:35:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-06 22:35:06,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:06,865 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:06,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:35:06,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:06,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:06,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1431064419, now seen corresponding path program 1 times [2023-11-06 22:35:06,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:35:06,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533218427] [2023-11-06 22:35:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:06,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:35:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:06,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:35:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:35:07,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:35:07,149 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:35:07,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:35:07,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:35:07,155 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:35:07,160 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:35:07,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:35:07 BoogieIcfgContainer [2023-11-06 22:35:07,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:35:07,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:35:07,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:35:07,275 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:35:07,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:04" (3/4) ... [2023-11-06 22:35:07,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:35:07,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:35:07,280 INFO L158 Benchmark]: Toolchain (without parser) took 4626.90ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 133.7MB in the beginning and 130.6MB in the end (delta: 3.1MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,280 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:07,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.66ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 118.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.93ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 114.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,282 INFO L158 Benchmark]: Boogie Preprocessor took 56.36ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 112.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,283 INFO L158 Benchmark]: RCFGBuilder took 997.04ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 113.5MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,283 INFO L158 Benchmark]: TraceAbstraction took 3152.06ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 112.9MB in the beginning and 130.6MB in the end (delta: -17.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2023-11-06 22:35:07,283 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 201.3MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:07,286 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.66ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 118.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.93ms. Allocated memory is still 165.7MB. Free memory was 118.4MB in the beginning and 114.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.36ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 112.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 997.04ms. Allocated memory is still 165.7MB. Free memory was 111.5MB in the beginning and 113.5MB in the end (delta: -2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3152.06ms. Allocated memory was 165.7MB in the beginning and 201.3MB in the end (delta: 35.7MB). Free memory was 112.9MB in the beginning and 130.6MB in the end (delta: -17.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 201.3MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L51] signed char last_1_WrapperStruct00_var_1_1 = -16; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=-16] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_1 [L109] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L86] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-31, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00.var_1_6=-31, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00.var_1_6=-31, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00.var_1_6=-31, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00.var_1_7=-63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00.var_1_7=-63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00.var_1_7=-63, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L95] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00.var_1_11=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00.var_1_11=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00.var_1_11=257, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L98] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_13 [L99] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_13 [L99] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] EXPR (WrapperStruct00.var_1_13 >= 0.0F && 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 >= 0.0F && 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 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && 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 >= 0.0F && 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 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F=1, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00.var_1_15=127, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L104] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00.var_1_17=-258, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00.var_1_17=-258, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00.var_1_17=-258, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00.var_1_17=-258, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L55] COND TRUE WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) [L56] EXPR WrapperStruct00.var_1_17 [L56] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L58] EXPR WrapperStruct00.var_1_13 [L58] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_13 - 8.3) [L59] EXPR WrapperStruct00.var_1_13 [L59] EXPR WrapperStruct00.var_1_12 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12; [L60] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_1=1] [L60] COND TRUE WrapperStruct00.var_1_5 && stepLocal_1 [L61] EXPR WrapperStruct00.var_1_16 [L61] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16 [L65] WrapperStruct00.var_1_5 VAL [WrapperStruct00.var_1_5=-255, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_1=1] [L65] COND TRUE WrapperStruct00.var_1_5 [L66] EXPR WrapperStruct00.var_1_16 [L66] EXPR WrapperStruct00.var_1_16 [L66] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16) [L74] EXPR WrapperStruct00.var_1_8 [L74] EXPR WrapperStruct00.var_1_16 [L74] unsigned long int stepLocal_0 = (WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16; [L75] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_0=0, stepLocal_1=1] [L75] COND FALSE !(stepLocal_0 > WrapperStruct00.var_1_8) [L82] EXPR WrapperStruct00.var_1_6 [L82] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_6 [L112] EXPR (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6)) VAL [(((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))) [L112] EXPR WrapperStruct00.var_1_5 VAL [((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))) [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))) VAL [((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))=1, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))) VAL [((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))=1, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3))) [L112] EXPR WrapperStruct00.var_1_12 [L112] EXPR WrapperStruct00.var_1_13 [L112] EXPR (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3))) VAL [((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_12=1000000000011, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))=1, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15))) VAL [((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))=0, (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))=0, ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_12=1000000000011, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))=1, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1) VAL [(((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1)=0, ((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))=0, (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))=0, ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))=1, (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))=1, WrapperStruct00.var_1_12=1000000000011, WrapperStruct00.var_1_13=1000000000001, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_16=-258, WrapperStruct00.var_1_1=-31, WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))=1, WrapperStruct00.var_1_5=-255, WrapperStruct00.var_1_6=-31, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00.var_1_8=508, WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112-L113] return (((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1) ; [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_1=-16] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 1095 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 633 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 462 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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:35:07,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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 08148e8c3c8eecfc4014e5c0b3637b2b2d997939cef63f1309d0f584d4ec63a9 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:35:09,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:35:10,048 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 22:35:10,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:35:10,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:35:10,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:35:10,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:35:10,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:35:10,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:35:10,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:35:10,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:35:10,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:35:10,089 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:35:10,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:35:10,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:35:10,091 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:35:10,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:35:10,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:35:10,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:35:10,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:35:10,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:35:10,094 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:35:10,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:35:10,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:35:10,096 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:35:10,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:35:10,097 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:35:10,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:35:10,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:35:10,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:35:10,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:10,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:35:10,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:35:10,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:35:10,101 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:35:10,101 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:35:10,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:35:10,102 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:35:10,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:35:10,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:35:10,103 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:35:10,104 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:35:10,104 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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 -> 08148e8c3c8eecfc4014e5c0b3637b2b2d997939cef63f1309d0f584d4ec63a9 [2023-11-06 22:35:10,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:35:10,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:35:10,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:35:10,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:35:10,539 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:35:10,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:13,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:35:14,000 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:35:14,001 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:14,010 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/2a39f0652/5d29e6a4e02e473ab3c89e8fdf4ee284/FLAG16abe351d [2023-11-06 22:35:14,024 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/data/2a39f0652/5d29e6a4e02e473ab3c89e8fdf4ee284 [2023-11-06 22:35:14,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:35:14,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:35:14,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:14,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:35:14,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:35:14,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26594188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14, skipping insertion in model container [2023-11-06 22:35:14,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,075 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:35:14,261 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i[916,929] [2023-11-06 22:35:14,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:14,387 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:35:14,404 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i[916,929] [2023-11-06 22:35:14,477 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:35:14,518 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:35:14,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14 WrapperNode [2023-11-06 22:35:14,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:35:14,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:14,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:35:14,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:35:14,530 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:35:14" (1/1) ... [2023-11-06 22:35:14,562 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:35:14" (1/1) ... [2023-11-06 22:35:14,617 INFO L138 Inliner]: procedures = 36, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 344 [2023-11-06 22:35:14,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:35:14,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:35:14,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:35:14,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:35:14,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:35:14,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:35:14,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:35:14,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:35:14,705 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (1/1) ... [2023-11-06 22:35:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:35:14,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:35:14,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:14,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:35:14,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:35:14,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:35:14,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:35:14,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:35:14,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 22:35:14,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:35:14,914 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:35:14,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:35:16,024 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:35:16,032 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:35:16,032 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:35:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:16 BoogieIcfgContainer [2023-11-06 22:35:16,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:35:16,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:35:16,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:35:16,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:35:16,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:35:14" (1/3) ... [2023-11-06 22:35:16,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9ac401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:16, skipping insertion in model container [2023-11-06 22:35:16,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:35:14" (2/3) ... [2023-11-06 22:35:16,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9ac401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:35:16, skipping insertion in model container [2023-11-06 22:35:16,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:35:16" (3/3) ... [2023-11-06 22:35:16,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-41.i [2023-11-06 22:35:16,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:35:16,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:35:16,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:35:16,142 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;@2cbc7e59, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:35:16,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:35:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:35:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-06 22:35:16,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:35:16,163 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:16,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:35:16,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:35:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1210687020, now seen corresponding path program 1 times [2023-11-06 22:35:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:35:16,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588042829] [2023-11-06 22:35:16,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:35:16,185 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:35:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:35:16,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,464 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 22:35:16,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,666 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,671 INFO L158 Benchmark]: Toolchain (without parser) took 2641.65ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 53.5MB in the beginning and 50.8MB in the end (delta: 2.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,671 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 77.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:16,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.80ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 37.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.53ms. Allocated memory is still 77.6MB. Free memory was 37.4MB in the beginning and 34.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,673 INFO L158 Benchmark]: Boogie Preprocessor took 84.28ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 34.0MB in the beginning and 72.3MB in the end (delta: -38.3MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,674 INFO L158 Benchmark]: RCFGBuilder took 1331.13ms. Allocated memory is still 94.4MB. Free memory was 72.3MB in the beginning and 43.4MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 22:35:16,674 INFO L158 Benchmark]: TraceAbstraction took 631.34ms. Allocated memory is still 94.4MB. Free memory was 43.0MB in the beginning and 50.8MB in the end (delta: -7.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:35:16,678 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 77.6MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.80ms. Allocated memory is still 77.6MB. Free memory was 53.5MB in the beginning and 37.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.53ms. Allocated memory is still 77.6MB. Free memory was 37.4MB in the beginning and 34.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.28ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 34.0MB in the beginning and 72.3MB in the end (delta: -38.3MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1331.13ms. Allocated memory is still 94.4MB. Free memory was 72.3MB in the beginning and 43.4MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 631.34ms. Allocated memory is still 94.4MB. Free memory was 43.0MB in the beginning and 50.8MB in the end (delta: -7.8MB). 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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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:35:16,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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_86d4cf64-1ae9-41e3-ba52-864a190fbc98/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.